a. Write a pseudocode for a divide-and-conquer algorithm for finding the position of the largest element in an array of n numbers.
b. What will be your algorithm's output for arrays with several elements of the largest value?
c. Set up and solve a recurrence relation for the number of key comparisons made by your algorithm.
d. Write a brute force algorithm for the same problem.
e. How does this algorithm compare with the brute-force algorithm for this problem?