Exercise (30 points) Counting Sort COUNTING-SORT(A, B, k) 1 let Co..k] be a new array 2 for i = 0 to k 3 C[i] = 0 4 for j = 1 to A.length 5. C[A[j]] = C[A[j]] +1 6 / C[i] now contains the number of elements equal to i. 7 for i = 1 to k 8 C[i] = C[i] + C[i 1] 9 11 C[i] now contains the number of elements less than or equal to i. 10 for j = A.length downto 1 11 B[C[A[j]]] = A[j] 12 C[A[;)] = C[A[j]] - 1 Suppose that we are given a sequence A of n positive real numbers (az, az, .., a.) to sort. a) (2 points) Can you use Count Sort AS IS to sort A? Explain b) (28 points) How can you adapt Counting Sort to sort the sequence A? Clearly state your assumptions and describe clearly using pseudocode your new Counting Sort algorithm