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]. (6) Draw the quick sert tree for an execution of this modified quick sort algorithm on the input sequence from fah (d) What is the running time of this version of quick-sort on a sequence that is already sorted