Problem $3$

If we use the SELECT algorithm to find the medium and use the medium as the pivot for Quicksort, we can make Quicksort nun in $O(nlogn)$ in the worst$-$case scenario. Prove this claim.