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) a) Merge sort b) Quick sort c) Tournament method d) Bubble sort