Sort the following list with the following sorts, showing all the intermediate steps. 72, 2,0,9,42, 24, 1, -8 (a) [8 pts.] Selection Sort (Please use the symbol, as shown in the practice problems, to divide the sorted portion of the array from the unsorted portion.) (b) [8 pts.] Merge Sort (You need only show the pyramid diagram of how the list is broken and recombined into a sorted list. You can submit a neat, handwritten diagram for this part).