Problem 4. (13 marks) Describe a method for finding both the minimum and maximum of n numbers using fewer than 3n/2 comparisons. (Hint: first construct a group of candidate minimums and a group of candidate maximums). Then, write a pseudocode for your method. What loop invariant(s) does your algorithm maintain? Pick up one of them and show the properties of Initialization, Maintenance, and Termination