Given:

struct Point{ double x; double y; Point(double a = 0, double b = 0){ x = a; y = b; } }; struct Pair{ int indexPointOne; int indexPointTwo; }; 

Write a closest Pair Function:

Function Prototype: Pair Closest_Pair( Point P[ ], int n) Input: An array P of n (n >= 2 and n <= 1000) Points P1 = (x1,y1)  Pn = (xn, yn) Return: A Pair of Indices where indexPointOne and indexPointTwo are the closest pair of points in the array of Points P. If more than two pairs of Points are the closest, return the pair of Points with the smallest average index.