\begin{tabular}{l} \hline Algorithm 1 int [ countingSort(int A[1n], int k) \\ \hline 1: //Precondition: The n values in A are all between 1 and k \\ 2: Let C[1k] be a new array \\ 3: //We will store our sorted array in the array B. \\ 4: Let B[1n] be a new array \\ 5: for i=1 to k do \\ 6: C[i]=0; \\ 7: end for \\ 8: for j=1 to n do \\ 9: C[A[j]]=C[A[j]]+1; \\ 10: end for \\ 11: //C[i] now contains the \# of elements in A equal to i \\ 12: for i=2 to k do \\ 13: C[i]=C[i]+C[i1]; \\ 14: end for \\ 15: //C[i] now contains the \# of elements in A that are to i \\ 16: for j=n down to 1 do \\ 17: B[C[A[j]]=A[j]; \\ 18: C[A[j]]=C[A[j]]1; \\ 19: end for \\ 20: return B; \end{tabular} Illustrate the operation of countingSort ({2,1,5,3,1,2,5},k). Specifically, show the changes made to the arrays A,B, and C for each pass through the for loop at line 16