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

the recurrence:

T$($n$)=2$T $($n$/2)+0($n log n$).$

Show that the solution to this recurrence is On log$?$n$).$

$($d$)$ Can you bring the running time down to On