Prove that the divide-and-conquer algorithm for the closest-pair problem examines, for every point p in the vertical strip (see Figures 5.7a and 5.7b), no more than seven other points that can be closer to p than dmin, the minimum distance between two points encountered by the algorithm up to that point Xem di yo X=m (a) FIGURE 5.7 lal Idea of the divide and conquer algorithm for the closest-pair problem. b) Rectangle that may contain points closer than dia to point p. Prove that the divide-and-conquer algorithm for the closest-pair problem examines, for every point p in the vertical strip (see Figures 5.7a and 5.7b), no more than seven other points that can be closer to p than dmin, the minimum distance between two points encountered by the algorithm up to that point Xem di yo X=m (a) FIGURE 5.7 lal Idea of the divide and conquer algorithm for the closest-pair problem. b) Rectangle that may contain points closer than dia to point p