Divide and Conquer. Write pseudo-code for a divide-and-conquer algorithm that finds the first position of the largest element in an array of n numbers. Duplicates are allowed, and the values are not sorted.