You are given an unsorted array A[1, ..., n]. We know that the maximum (or minimum) element in the array can be found in (n-1) comparisons. Write an algorithm that finds both the maximum and the minimum element in the array in ~(3n/2) comparisons, i.e., (3n/2) + THETA(1) comparisons.