Consider the following well-known maxelement algorithm. ALGORITHM BruteForceClosestPoints (P) //Input: A list P of n(n2) points P1=(x1,y1),,Pn=(xn,yn) //Output: Indices index 1 and index 2 of the closest pair of points dmin for i1 to n1 do for ji+1 to n do dsqrt((xixj)2+(yiyj)2)//sqrt is the square root function if d