You can actually find the median by running a sorting algorithm and stopping early, as soon as you know the median.

(a) Assume you use Bubble Sort to find the median of 7 elements (i.e. n = 7), but stop as soon as you know the median. Exactly how many comparisons do you use (in the worst case)?

(b) Assume you use Mergesort to find the median of 7 elements (i.e. n = 7), but stop as soon as you know the median. Exactly how many comparisons do you use (in the worst case)?