(15 pts.) Write pseudocode for a divide-and-conquer algorithm for finding values of both the largest and smallest elements in an array of n numbers. Set up a recurrence relation for the number of key comparisons made by your algorithm and solve it (for n -2 *)