Write in Java (Data Structures). Write a program that implements a selection sort of an array of numbers 50 to 70. Program needs to... 1: One-by-one, move boundary of an unsorted array of numbers. 2: Find the minimum element in the unsorted array 3: Swap the found minimum element with the first element.  4: Print out the array of numbers sorted. Add comments to describe what the code is doing.

Write a java program to count the odd numbers in the array contents 20 elements. Then find out the summation of an odd numbers.

Write a code for the following scenario in python:   Suppose you have two arrays: Arr1 and Arr2.Arr1 will be sorted values. For each element v in Arr2, you need to write a pseudo code that willprint the number of elements in Arr1 that is less than or equal to v.For example: suppose you are given two arrays of size 5 and 3 respectively.5 3 [size of the arrays]Arr1 = 1 3 5 7 9Arr2 = 6 4 8The output should be 3 2 4Explanation: Firstly, you should search how many numbers are there in Arr1 which areless than 6. There are 1, 3, 5 which are less than 6 (total 3 numbers). Therefore, the answerfor 6 will be 3.After that, you will do the same thing for 4 and 8 and output the corresponding answerswhich are 2 and 4. Your searching method should not take more than O (log n) time.   please use binary search

use java to create a card game with the implements listed for the program. If you are able to do the first couple of steps that would be helpful and for step one use an array list with the following code. The code below should create 52 cards. String[] suits = {"Hearts", "Clubs", "Spades", "Diamonds"}; String[] numbers = {"A", "2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K"};          for(String oneSuit : suits){    for(String num : numbers){                       System.out.println(oneSuit + " " + num);                     } }

Use java.

Java programming For an array of 20 integers (Declare all necessary variable).Write separate code segments to do the following (NOT a whole completeprogram). *  Find and display the negative odd numbers in reverse order.

Write a program that does the following: 1. prompts the user to guess a letter in a hard-coded word 2. validates the input 3. adds the letter to a two-dimensional array that stores the guessed letter (string) and the number of times that letter has been guessed (int). If the letter is already in the list, then the list should be updated accordingly (i.e., no duplicate letters in the list!) The list will follow this format: [[guessed letter 1, number of guesses],[guessed letter2, number of guesses],...] Example: [[“a”, 3], [“e”, 2], [“c”, 1]] Hint : this will require iterating over the list, remember that the character is always in position [x][0] 4. check if the character is in the word 5. outputs if the character is in the word and the number of times this character has been guessed 6. the program should continue to prompt the user until they enter ‘quit’   Output example:    #the word is kookaburra Enter a letter: a The letter ‘a’ is in the word Number of times guessed the letter…