consider the problem of finding the distance between the two closest numbers in an array of n numbers. (the distance between two numbers x and y is computed as |x − y|.) a. design a presorting-based algorithm for solving this problem and determine its efficiency class. b. compare the efficiency of this algorithm with that of the brute-force algorithm (see problem 9 in exercises 1.2)