The following algorithm is an implementation of counting sort, which sorts input array A into output array B, utilizing temporary array array C: for i 1 to k initialize array C Cli 0 forj = l to A.length // C[i] will contain the number of elements equal to i IClil will contain the number of elements less than or equal to i for i = 1 to k for j = A-length downto 1 Will the above algorithm still work if the last loop is modified to:1 to A. length? Explain why or why not. If it does not work, give a counter example. If it does work, is there an advantage to the original version vs. the modified one