Problem 2 (a) Draw the merge tree for an execution of the merge-sort algorithm on the input sequence (6,9,20,8,14,27,43,22,30, 19) (b) Draw the quick-sort tree for an execution of the quick-sort algorithm on the input sequence from (a) Suppose we modify the deterministic version of the quick-sort algorithm so that, instead of selecting the last element in an n-element sequence as the pivot, we choose the element at rank n/4 (c) Draw the quick-sort tree for an execution of this modified quick-sort algorithm on the input sequence from (a). (d) What is the running time of this version of quick-sort on a sequence that is already sorted