down the pseudocode for the algorithm, and show that its running time is given by

is minimized.

the recurrence:

Show that the solution to this recurrence is O$($n log$2$ n$).$

T $($n$)=2$T $($n$/2)+$ O$($n log n$).($d$)$ Can you bring the running time down to O$($n log n$)?$