Question: Apply the algorithm described in Example for finding the closest pair of points, using the Euclidean distance between points, to find the closest pair of the points (1, 3), (1, 7), (2, 4), (2, 9), (3, 1), (3, 5), (4, 3), and (4, 7).
Example: The Closest-Pair Problem Consider the problem of determining the closest pair of points in a set of n points (x1, y1), . . . , (xn, yn) in the plane, where the distance between two points (xi, yi) and (xj , yj ) is the usual Euclidean distance √((xi - xj)2 + (yi - yj)2). This problem arises in many applications such as determining the closest pair of airplanes in the air space at a particular altitude being managed by an air traffic controller. How can this closest pair of points be found in an efficient way?
