Given an array of n numbers. Finding minimum takes n−1 comparisons. Finding maximum takes n−1 comparisons. If you had to simultaneously find both minimum and maximum, what is the minimum number of comparisons you may require?