Illustrate and show for problem 10... and for 11 & 12 explain and show

Problem 10: Perform counting sort on an array containing the following numbers: 2, 5, 7,8,2,6,7,9,9,2, 8 5, 0, , 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 2 in index 0 should end up in a different index than the 2 in index 4. Problem 11 Explain why the time complexity of radix sort similar to the time complexity of merge sort. Problem 12: What would the aSort method, given below, print (printArray prints the contents of sortThisArray) if an array containing the following integers given below is passed as the int[] parameter? int [ sortThisArray new int40, 71,48, 77,81, 62, 58, 72, 81,79) public void aSort (int[lsortThisArray) ( int temp; for (int . 1; sortThisArrayl-11) temp sortThisArray sortThisArray-sortThisArray(-11 sortThisArraytj-11tempi printArray(sortThisArray) sortThlsrrayi3-p, at-l1