Suppose that the array being sorted contains only integers in the range 0 to k and that there are no satellite data to move with those keys. Write a code that modifies the counting sort to use just the arras A and C, putting the sorted result back into array A instead of into a new array B COUNTING-SORT(A, B, k) for i=1 to k 1 2 3 4 do C[i] - 0 for j1 to length [A] 10 11 do C[A[]]C[A[j]] + 1 C[i] now contains the number of elements equal to i. 5 6 for i-2 to k 7 8 9 do C[i] - C[i] + C[i-1] C[i] now contains the number of elements less than or equal to f. for j-length [4] downto 1 do B[C[A[j]]] A[j] C[AU] - C[AU]] - 1