Public static int[] sortthisarray-new int[{45, 78, 92, 21, 62, 8, 2, 81, 9, 25, 98}; if you have a method that selects the best pivots for quicksort (do not use the default pivot selection method), indicate what pivots would be selected and provide the values in sort thisarray (provided above) once the final position for a pivot has been determined. problem 8: public static int 1001); sort thisarray = new int[]{1001, 1101, 11101, , 0011, 0111, perform binary radix sort (ascending order) on sortthisarray, provided above, by listing the contents of the array after each bucketization. problem 9: explain why the time complexity for merge sort o(nlogn)? using the recurrent expression for merge sort in your explanation. problem 10: perform counting sort on an array containing the following numbers: 1, 6, 7, 8, 2, 6, 7,9, 9, 3, 8, 5, 0, 1, 4 (from index 0 to 14). the numbers are integers that can take values between 0 and 9 inclusively. indicate where in the final sorted array each number will end up. the 1 in index 0 should end up in a different index than the 1 in index 13.