Note: This assignment has two pages. 1. (15 points) Consider the following sequence of items 28, 33, 12, 48, 39, 18, 21, 63, 45, 80, 52, 85. Perform mergesort on these items with their initial order shown above. Show the sequence at each level of the recursion from start to end, in the format as shown in the example on page 7 of the lecture note (with file name Lec1-Intro-Alg.pdf posted on NYU Classes). (Just hand-simulate the behavior of the mergesort algorithm and write down the results similar to the example in the lecture note.) (Note: If the current problem size is not even, use the convention that the left half has one more item than the right half when we split.)