Solve the below 2-D version example of the Closet-Pair Problem by Divide and Conquer. Please show me your solution step by step. Provide explanation when necessary. Justify the running time of your proposed solution. Algorithm For Closet-Pair Problem: 1. Sort all points according to the x coordinates. 2. Divide all points into two subsets with the help of a middleIndex. 3. Find the minimum distance recursively in the two subsets. 4. Calculate the minimum of these smallest distance. d = min(d1,d2) 5. check the neighbour of the middle line there may be points that are closer to each other than min(d1,d2) . so we get a stripMinimum. 6. Find the smallest distance in the strip. 7. Finally return min(d.stripMinimum).

I need a step by step solution and also the program . thank you in advance.