explains how you would solve it using Dynamic Programming approaches.

Closest Pair of Points: Given a set of points in a two$-$dimensional space, the task is to find the pair of points that are closest to each other. This problem involves both divide$-$and$-$conquer techniques and computational geometry.Explain the algorithm, possible issues. Also give the run$-$time and space analysis $.$