Consider the following algorithm that operates on a list of n integers:

Divide the n values into n 2 pairs

Find the max of each pair.

Repeat until you have the max value of the list

(a) Show the steps of the above algorithm for the list (25,19,9,8,2,26,21,26,31,26,3,14).

(b) Derive and prove a tight bound on the asymptotic runtime of this algorithm

(c) Assuming you just ran the above algorithm, show that you can use the result and all intermediate steps to nd the 2nd largest number in at most log2 n additional steps