) For a set S of n real numbers, a pair of elements x, y in S, where x < y, are said to be close if y - x (max(S) min(S)) / (n-1). Suppose you are given an unsorted array A[1 n] of distinct real numbers. Design an algorithm that finds a pair of close numbers in A in (n) time. (Note: Your algorithm does not have to find all close pairs.)