3. (33.33 points) Write the steps or pseudocode for a divide-and-conquer algorithm for finding the position of the largest element in an array of n numbers. Set up and solve a recurrence relation for the running time of this algorithm. How does the run time of this algorithm compare with the brute-force algorithm