please solve the below 22.7 problem using java. and also give comments on every deails. thanks in advance.

2.7 (Closest pair of points) Section 22.8 introduced an algorithm for finding the closest pair of points using a divide-and-conquer approach. Implement algorithm to meet the following requirements: the Define a class named Pair with the data fields p1 and p2 to represent two points and a method named getDistance () that returns the distance between the two points. Implement the following methods: /** Return the distance of the closest pair of points public static Pair getclosestPair(double[][] points) / . Return the distance of the closest pair of points" public static Pair getclosestPair (Point2DI] points) / Return the distance of the closest pair of points * in pointsOrderedOnX[low. .high]. This is a recursive method. pointsOrderedOnX and pointsOrderedOnY are not changed in the subsequent recursive calls public static Pair distance (Point2D[] pointsOrderedonX, int low, int high, Point2D[] pointsOrderedonY) /* Compute the distance between two points p1 and p2 / public static double distance (Point2D p1, Point2D p2) / Compute the distance between points (x1, y1) and (x2, y2) public static double distance (double x1, double y1 double x2, double y2)