2. Suppose we took the Counting Sort code from lecture, and altered the last loop so that it goes up from 1 to A.length instead of down from A.length to 1 , as follows: Would the algorithm still sort correctly? Would it still be stable? Explain your answers