Textbook: Introduction to Algorithms (3rd edition) by T. Cormen, C. Leiserson, R. Rivest and C. Stein, MIT Press, 2009

Show all work (if necessary).

So far, we only covered insertion-sort and merge-sort in class. Do not use other sorting algorithms.

3. Give the running time at each step of the following high-level description of an algorithm, along with the total running time, briefly justifying each step. The input is an array with n items. The array is scanned left-to-right (that is, we have a for loop fron i = 0 to n-1), and at each iteration we do the following a) Set AU] Aj] mod Ali] for all 0 SjSn-1. b) Sort the resulting array A. Solution. Your solution here