Assistance on C and D are needed, mostly C. Please do C and show full work on getting to the solution, mostly what my pivots are when the sorting begins. Thank you.

a) (5 points) Draw the merge-sort tree for an execution of the merge-sort algorithm on the input b) (5 points) Draw the quick-sort tree for an execution of the quick-sort algorithm on the input (c) (5 points) Draw qui (d) (2 points) What is the running time of the version of quick-sort in part (c) on a sequence that is sequence: (2, 5, 16, 4, 10, 23, 39, 18, 26, 15) (like in Figure. 4.2). sequence from part (a) (like in Figure 4.12). Use the last element as the pivot. sequence from part (a) (like in Figure 4.12). Use the element at rank as the pivot. already sorted? Explain. C) ( polnts Draw the quick-sort tr'ee lor an execution of the quick-sort algornthm on the npu