c) (5 points) Draw the quick-sort tree for an execution of the quick-sort algorithm on the input sequence from part (a) (like in Figure 4.12). Use the element at rank J as the pivot. (d) (2 points) What is the running time of the version of quick-sort in part (c) on a sequence that is already sorted? Explain