-Please answer this questions:

1). a. Write pseudocode for a divide-and-conquer algorithm for nding the position of the largest element in an array of n numbers.

b. What will be your algorithms 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. How does this algorithm compare with the brute-force algorithm for this problem?

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. b. Set up and solve (for n = 2k) a recurrence relation for the number of key comparisons made by your algorithm. c. How does this algorithm compare with the brute-force algorithm for this problem?

3). a. Write pseudocode for a divide-and-conquer algorithm for the exponentiation problem of computing an where n is a positive integer. b. Set up and solve a recurrence relation for the number of multiplications made by this algorithm.