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?