Question 6 (): (From Section 11.4 A-11.1) Design a divide-and-conquer algorithm for finding both the maximum and minimum element of a collection of n numbers using no more than 3n/ 2 comparisons. Prove the algorithm is correct and justify the maximum number of comparisons