(Solved) : Please Hand Written Answer Java Book Introduction Java Programming 11th Ed Liang Use Point Q36506230 . . . .

please no hand written answer

JAVA – Book: Introduction to Java Programming, 11th ed.by Liang

**use point2D as mentioned in methods**

(Closest pair of points) Section 22.8 introduced thefollowing algorithm for finding the closest pair of points using adivide-and-conquer approach:

Step 1: Sort the points in increasing order of x-coordinates.For the points with the same x-coordinates, sort on y-coordinates.The result should be a sorted collection of points denoted byS.

Step 2: Divide S into two subsets, S1 andS2, of equal size about the midpoint of the sorted listS. Include the midpoint in S1. Recursively find theclosest pair in S1 and S2. Let d1and d2 denote