$($a$)$ Write down the recurrence for the running time for the case where the algorithm chooses the median as the pivot at each iteration.

$($b$)$ Calculate a tight bound for this recurrence using the Master Theorem.

$($c$)[5$ points$]$ Write down the recurrence for the running time for the case where the algorithm chooses the smallest element in the array as the pivot at each iteration.