Given n distinct items:

1. Assuming n is a power of 2, write down a recursive divide-and-conquer algorithm for solving simultaneous minimum and maximum, using n = 2 as the bottom of the recursion.
2. If we let T(n) denote the number of comparisons done by your algorithm, write down the recurrence relation satisfied by T(n).
3. Solve exactly (without using the big O notation) the recurrence relation for T(n), showing all the details of your work.