Question

1. Given the following list 107, 22, 53, 85, 21, 6, 97, 6, 32 Use merge sort to fill the following table that shows the value of first and last arguments in calling the quick sort method and the content of the list after each merging a. After f list merge firstlast method O 34 6 7 [8) b. Use number of elements in the merge sort in part a to draw the merge sort tree that shows the divide process, e. Give the number of times the merge sort and the merge method are called in your solution of part a d. Use quick sort to fill the following table that shows the value of left and right arguments in calling the quick sort method, the value of pivot after calling partition method, and the content of the list after each guick sort or partition methods Pivot value in Quick sort leftright if available) Content of list [0] [ 3415 6 781 Use number of elements in the quick sort in part d to draw the quick sont tree that shows the divide e. f. g. Give the number of times the quick sort and the partition methods are called in your solution of part d Which of the two sort methods is more efficient according to this given list? Give explanation that verify your answer.

Answer 1