Given the following method header, give the code for the function using a binary search of an array. Don’t worry about the precondition (assume this is already true).   public static boolean has10 (int[ ] data, int start, int end) // Precondition: The elements data[start]...data[end] are sorted from smallest to largest. This // array segment might be empty (indicated by end being less than start). // Postcondition: A true return value indicates that the number 10 appears in the array // data[start]...data[end]. A false return value indicates that 10 doesn’t appear.

Using a Java program solve the following problem using arrays: Past A: Coupon collector is a classic statistic problem with many practical applications. The problem is to pick objects from a set of objects repeatedly and determine how many picks are needed for all the objects to be picked at least once. A variation of the problem is to pick cards from a shuffled deck of 52 cards repeatedly and find out how many picks are needed before you see one of each suit. Assume a picked card is placed back in the deck before picking another. Write a program to simulate the number of picks needed to get total of four cards from each different suit and display the four cards picked (it is possible that a card may be picked twice). Here is a sample run of the program: Queen of Spades 5 of Clubs Queen of Hearts 4 of Diamonds Number of picks: 12 Sample run explanation: As you see in the above run, 12 picks are made to get the four cards from different suits. The other 8 picks (12-4-8) were from the…

1) Write a method in java that performs the union operation on two integer arrays, i.e. it will createa new array that has the values from the two input arrays but with no duplicates.• The method must have the following signature:public static int[] union(int[] a1, int[] a2)• You can assume that no input array element will have a value less than 1.• Your method can return an array that is the same size as the two input arrays puttogether. This will mean, in general, the returned array will have too many elements.This is fine. Any elements you don’t need, you simply set to zero.• Implement this method using Java primitives only. You may use the array lengthproperty.• If you want to implement other methods to help you, you may do so. You must writethe method specified above, but you may write other methods to help you if you wantto. You must show the full implementation of any methods you create, however.

PLEASE TYPE ONLY*** JAVA PROGRAMMING Task: a program called ArrayList_Practice. In this program, please do the following operations. Complete a method called RedundantCharacterMatch(ArrayList<Character> YourFirstName): the parameter of this method is an ArrayList<Character> whose elements are the characters in your first name (they should be in the order appear in your first name, e.g., if your first name is bob, then the ArrayList<Char> includes ‘b’, ‘o’, ‘b’.). The method will check whether there exists duplicate characters in your name and return the index of those duplicate characters. For example, when using bob as first name, it will return b: 0, 2. Create ArrayList<Character> NameExample. All the characters of your first name will appear twice in this ArrayList. For example, if your first name is bob, then NameExample will include the following element {b,o,b,b,o,b}. Then, please use NameExample as parameter for the method RedundantCharacterMatch().…