Consider the following algorithm to compute the two closest points in a set of n points (age is the square root function). ALGORITHM Brute ForceClosestPoints(P) //Input: A list P of n (n 2) points Pi-(x, y), P=(x3) // Output: Indices index: and index; of the closest pair of points for 1 ton-1 do forj 1+1 ton do dsqrt((x-x1)+(y-y)) if d