It is straightforward to use 2n ! 3 comparisons to ?nd both the minimal and the maximal elements in a given set of n elements (how? you should think about this, but do not need to hand in the answer). Now design a divide-and-conquer (recursive) algorithm to accomplish the same. Your algorithm should use at most 3n/2 comparisons. (Suppose n is a power of