Algorithms course

3. Given an array A of n numbers, we would like to find the minimum and the maximum numbers in A. Assume that n is a power of 2, that is, n = 2k for some k. (a) Design a divide-and-conquer algorithm for the problem that makes at most 3n/2 comparisons. (b) Design an iterative algorithm for the problem that makes at most 3n/2 comparisons