We all studied Divide and Conquer approaches for solving problems. We used this method for sorting and counting inversions. Let's talk about another problem called 'Finding the closest pair of points.' In this problem, we are given n points and we need to find out the closest two points among them. Straight forward! Isn't it? Yes, we could just take all the possible pairs and calculate their distances. But, when the number of points is too high, this is going to be a very costly approach. Here comes Divide and Conquer (DnC) - for our help. Let's not talk too much about it. - Your responsibility is to write on : (a) how DnC works, (b) how it shortens the time complexity, (c) how DnC solves the above-mentioned problem, and (d) time-complexity of your solution