This is for C++.

Given: struct Pointf double x double y; Point (double a 0, double b 0) y b 2; struct Pairf int indexPoint0ne; int indexPointTwo 3; Write a closest Pair Function: Function Prototype: Pair Closest Pair( Point P 1, int n) Input: An array P of n (n >_ 2) 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. Deliverables ClosestPair.h ClosestPair.cpp test.cpp - Test all functions with 3 distinct tests. Given: struct Pointf double x double y; Point (double a 0, double b 0) y b 2; struct Pairf int indexPoint0ne; int indexPointTwo 3; Write a closest Pair Function: Function Prototype: Pair Closest Pair( Point P 1, int n) Input: An array P of n (n >_ 2) 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. Deliverables ClosestPair.h ClosestPair.cpp test.cpp - Test all functions with 3 distinct tests