Write a Brute Force Algorithm to find the two closest points in a set of n points (in the two-dimensional Cartesian plane). Brute-force algorithm computes the distance between every pair of distinct points and return the indexes of the points for which the distance is minimum. Distance between two points Pi (xi , yi) and P, (x, y): d(P, P) = V[(x-x)? + (v-y)*] This problem arises in a number of applications. For example, in air-traffic control, you may want to monitor planes that come too close together, since this may indicate a possible collision. Analyze your algorithm to find time efficiency (O). Write program in Java based on your algorithm. For the purpose of testing, generate 100 points using class Random and save these points in an array. Assume that x-coordinate ranges from 1 to 50 and y-coordinate also ranges from 1 to 50. Print the output, i.e., all 100 points with indices and the indices of the minimum distance points.