a. Write a pseudocode for a divide-and-conquer algorithm for finding the position of the smallest element in an array of n numbers.

b. What will be your algorithms output for arrays with several elements of the smallest value?

c. Set up and solve a recurrence relation for the number of key comparisons made by your algorithm.