1:25 PM Wed Feb 12 27% Assignment1.pdf Ku Col Der Kuwait University Spring 2020 College of Engineering and Petroleum CpE-207: Data Structures & Department of Computer Engineering Algorithms 9. public static int[][] createRandomMatrix(int rows, int cols, int min, int max): creates and returns a two-dimensional array with rows rows and cols columns of random elements with values between min and max (use the Math.random( method of Java!). 10. public static int[] copyArray(int[] A): returns an array that is a copy of A. C. 11. public static int[][] copyMatrix(int[][] dimensional array that is a copy of A. A): returns a two- 12. public static int findInArray (int[] A, int 9): returns the position of the number q in the array A (returns - 1 if q is not present in A). 13. public static int findinSortedArrary(int[] A, int 9): returns the position of the number q in the sorted array A (returns -1 ifq is not present in A). The method assumes that the array A is sorted, it need not be correct if A is not sorted. Exploit the fact that the array is sorted to find an efficient algorithm. 14. public static int findFirstInSortedArrary(int[] A, int 9): returns the first position where the number q occurs in the sorted array A (returns -1 if q is not present in A). As before, the method assumes that the array A is sorted and need not be correct if A is not sorted. Again, exploit the fact that the array is sorted to find an efficient algorithm. B. Maxsort Add to your class ArrayUtility two static methode implementing the algorithm