Write code in C++

here is the link to the files: https://drive.google.com/open?id=1CNFpEpGizKzw7fkBaQYB5fv6gXFD__YS

Goal: Implement the O(n logn) version of closest pair. Instructions: Implement the closest pair algorithm (from the book). Basically, ill in closestPairo Please note that it is templated. Notes: DO NOT CHANGE metrics.h (it will be changed) You may add to targetgtest.cpp if you like (it will be overwritten). You may add files, if you like. (You can do this without any new files but the maximum is 20). Just keep them in the same directory as targetgtest.cpp As before to get this started: tar-xvzf Program 2_350.tar.gz cd Program 2 350 . mkdir build . cd build cmake e make . runUnitTests The one test that passes is running brute force closest pair multiple times. Submission: Upload just program2.h and new files, if any, (I will not include any files named "metrics.h" or "targetgtest.cpp" from your submission and will, instead use my own.). Do not zip or tar.gz anything. I want just the files. Goal: Implement the O(n logn) version of closest pair. Instructions: Implement the closest pair algorithm (from the book). Basically, ill in closestPairo Please note that it is templated. Notes: DO NOT CHANGE metrics.h (it will be changed) You may add to targetgtest.cpp if you like (it will be overwritten). You may add files, if you like. (You can do this without any new files but the maximum is 20). Just keep them in the same directory as targetgtest.cpp As before to get this started: tar-xvzf Program 2_350.tar.gz cd Program 2 350 . mkdir build . cd build cmake e make . runUnitTests The one test that passes is running brute force closest pair multiple times. Submission: Upload just program2.h and new files, if any, (I will not include any files named "metrics.h" or "targetgtest.cpp" from your submission and will, instead use my own.). Do not zip or tar.gz anything. I want just the files