3.1 In the video lecture for Sorting Algorithms: Section 7: Merge Sort Example we traced how merge sort would recursively sort list = { 4, 2, 7, 3, 5, 13, 11, 8, 6, 2 }. For this exercise, I would like you to draw a similar diagram showing how merge sort would sort list = { 5, 3, 1, 6, 2, 4 }. Scan this diagram and insert it into your final PDF. The objective of this exercise is to essentially see if you understand how the merge sort procedure works.

3.2 In Sorting Algorithms: Section 9: Merge Sort Pseudocode we discussed the high-level pseudocode for the merge sort algorithm. I wrote three methods: recursiveMergeSort(), merge(), and copyRest(). Continuing the previous exercise, how many times will recursiveMergeSort() be called when sorting the list of Exercise 3.1. Include the original nonrecursive call to recursiveMergeSort() and all of the recursive calls in the sum.