just write a pseudocode

6. (a) Write a divide-and-conquer algorithm for finding the position of the maximum integer in array A[L..r) of r-I+1 integers. Your algorithm's head line can be Maximum(ALL.rl), where A is the array of integers. (b) Set up a recurrence for the time complexity (i.e. the number of comparisons) of your algorithm when I - 1 and rn (i.e., finding the position of the maximum in array Api..n] ). (c) Solve the recurrence