Give a Divide-and-Conquer algorithm that finds the distance between the closest pair of points on a straight line. (You may assume the line to be parallel to the X-axis). Also give an analysis of your algorithm.Give a Divide-and-Conqueralgorithm that finds the distance between the closest pair of points on a straight line. (You may assume the line to be parallel to the X-axis). Also give an analysis of your algorithm. c++