Java8 programming, generics,collections, please explain in detail

Question 4: Finding the two closest points You have been given a large set of points scattered around a two-dimensional space. You will need to find a pair of points which distance is the smallest than any other pair of points. import java.util.List; import java.util.ArrayList; import java.util. Random; class Point { private double x; private double y; public Point (double x, double y) { this.x = x; this.y = y; } public double x() { return x; } public double y() { return y; } public String toString() { return "(" + x + ", " + y + ")"; } public class closestPair { public static List extends Point> generatePoints (int n) { List points = new ArrayList Random r = new Random(); for (int i = 0; i points) { Point[] pair = new Point [2]; //Your code here return pair; After succesfully testing your algorithm, ensure your method can accept multiple types that extend from type Point. Create a type called LocationPoint which will contain a string associated with the coordinate