Please complete these in easiest manner possible!!

1/This method should return the largest integer value contained in the argument array public static int nax(int[] arr) { return 0; } This method should compute the averageean of the values contained in the argument array. public static double average(int[] arr) { return 0.0; } I/This method should return true if a and b are identical arrays. // That is, return true if a and I have the sane length and the values at each index are equal 1/otherwise, the method should return false public static boolean areIdentical(int] a, int[] b) { return false; } // The arguments for this method will be two sorted arrays (sorted in increasing order). If the nethod must create and return anes sorted array that contains all the elements from a and also in increasing or IlIn other words, you are serging the two sorted Lists into a nen sorted list. I/There are many ways to solve this problem, some of which are more efficient than others. public static int[] merge(int[] a, int()) { return new int(0); } 1/this method should return the length of the longest increasing sequence in the argument array. 1/An increasing sequence consists of consecutive numbers that are each larger than the previous. 1/Fer example, in the array (0, 1, 2, 4, 3, 5, 71, 8-1-2-4 is an increasing sequence of length 4. Ill the same array, 3-5-7 is an increasing sequence of length 3. i/Note that 6-2-3-4-5-7 is not an increasing sequence as there is a 3 (which is not greater than 4) between 4 and 5. public static int Longest increasingSequence (int[] a) { return -1; }