3. (5 points) Counting Sort The Counting Sort algorithm can be used to sort integers in the range i-j, i0 by pre processing the input array A so that the algorithm can be applied to it as is with no modifications and then post-process the output array B to recover the original input in the sorted order. Explain in English what this will entail: (a) What is the pre-processing on A that can be done so that the algorithm can work with no modifications? (b) What is the value of k in this case (the algorithm requires prior knowledge of the input range 0-k)? (c) What is the post-processing on B that can be done so that the algorithm can work with no modifications