Write pseudocode for a divide$-$and$-$conquer algorithm for finding the position of the

largest element in an array of n numbers. Set up and solve a recurrence relation for the number

of key comparisons made by your algorithm. $($Hint: In more than one respect, this question is

similar to the divide$-$and$-$conquer computation of the sum of n numbers.$)$