Algorithms.

2. a. Write pseudocode for a divide-and-conquer algorithm for finding values of both the largest and smallest elements in an array of n numbers. comparisons made by your algorithm. problem? b. Set up and solve (for n 2k) a recurrence relation for the number of key c. How does this algorithm compare with the brute-force algorithm for this