PART A: The brute force algorithm for finding closest pair of points in 2D space is given below: ALGORITHM BruteFonciClosestPair (P) /Finds distance between two closest points in the plane by brute force IInput: A list P of n(n2) points p1(x1,y1)pn(xn,yn) /HOutput: The distance between the closest pair of points dfori1ton1doforji+1tondodmin(d,sqrt((xixj)2+(yiyj)2))//sqrtissquarerootreturnd Vrite a code to implement this algorithm in the language of your choice. Paste your omplete code here