Assuming that sqrt takes about 10 times longer than each of the other operations in the innermost loop of BruteForceClosestPoints, which are assumed to take the same amount of time, estimate how much faster the algorithm will run after the improvement discussed in Section 3.3

ALGORITHM Brute ForceClosestPair(P) /Finds distance between two closest points in the plane by brute force //Input: A list P ofn (n > 2) points pi (xi, yi), . . . , Pn (xn. ) Output: The distance between the closest pair of points fori1 to n-1 do for ji+1 to do d min(d, sqrt((xi-z)+ (yi-y,)*)) //sqrt s square root return d