Question: Sort the list 3, 1, 7, 2, 5, 4 into increasing order
(a) with a bubble sort;
(b) with a merge sort. In each case, how many comparisons are needed? (For the merge sort, ignore comparisons required to check the size and parity of n at each iteration of Step 3.)