(c)(6 points) Given an input array A with n integers in [0, k], we can use the array C in the counting sort to find out how many integers in A are in a range [a,b]. please finish the pseudocode below for this query. Assume C[i] already contains the number of input integers b) then return error; top = b; if (b > k) then top k; if (a