Consider the one$-$dimensional version of the closest$-$pair problem in which you are given

as input a set of $n$ points, $P,$ all of which lie on the $x-$axis. The output is the Euclidean

distance between the closest pair of points in $P.$ Design and analyze a divide and conquer

algorithm for this problem.