Suppose that an array being sorted contains only integers in the range $0$ to $k$ and that there

are no satellite data to move with those keys. Modify counting sort to use just the arrays $A$

and $C,$ putting the sorted result back into array A instead of into a new array $B.$ Justify the

running time of your modified counting sort.