Using c++

hverage 4. (15 points) Given the following code, what does the function do and what is the Big O complexity of the following function? You can assume 'points' has data and that 'n' is the number of points. To determine the complexity, figure out how many comparisons it does of the n points. double Farthestpoints( double pointsl], int n) double farthest-0.0; for ( int pl =0 ; p1 farthest) farthest = abs (points [p1]-points [p2]); return farthest Complexity: Purpose: Th PrPoi isto compre tne lurs