Figure 4.12 is below

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. 85 24 63 45 17 31 96 50 24 45 17 31 85 63 96 24 17 45 85 63 24 85 17 24 31 45 50 63 85 9%6 17 24 31 45 63 85 96) 17 24 45 63 85 24 85