Provide pseudocode only and time complexity part by part

Here, we are going to win a war using sound theory and algorithm. In a war, two countries are participating, country A and country B. A is planning to launch missiles on B to destroy each of their army camps. Now, A knows the location of each army camp of B as a 2D coordinate (x,y). When a missile attacks a place, it creates a huge sound. So, they are trying to optimize here by designing such a missile that will create very less sound. In this regard, they are planning to calculate all pair distances for each army camp. Their goal is to find the minimum pair distance among them. They are going to design a missile in such a way so that the sound it creates will be so milder that it would not reach the minimum distance even. For this, the other camps will not be informed early and they can take them by surprise and full power. Now, to solve this problem, you are going to write a divide and conquer based algorithm that will calculate the minimum pair distance found among all the pair distances. pq=(pxqx)2+(pyqy)2 Input: An array of N, 2D coordinates in the plane. Output: The smallest distance found between any pair of points in the given array