2. a. Write a pseudocode for a divide-and-conquer algorithm for finding valuesof

2. a. Write a pseudocode for a divide-and-conquer algorithm for finding valuesof 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 numberof key comparisons made by your algorithm.c. How does this algorithm compare with the brute-force algorithm forthis problem?3. a. Write a pseudocode for a divide-and-conquer algorithm for the exponentiationproblem of computing an where a > 0 and n is a positiveinteger.b. Set up and solve a recurrence relation for the number of multiplicationsmade by this algorithm.c. How does this algorithm compare with the brute-force algorithm forthis problem?