I need to find the POSITION of the largest element and not the largest element its self.

(a) Implement in C++ a divide and conquer algorithm for finding the position of the largest element in an array of n numbers. Show how your algorithm runs on the input

A = [1 4 9 3 4 9 5 6 9 3 7].

(b) What will be your algorithms output for arrays with several elements of the largest value? Indicate the answer on the input given above.

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