Arobotics company is designing a swarm of drones for efficient parcel delivery in a city. Each drone is equipped with a sensor array that helps it avoid collisions with other drones. The challenge is to design an algorithm that ensures the minimum distancebetween any two drones to prevent collisions during their operations.Given the coordinates of ndroneson a 2$2$D plane, devise a divide−$-$and−$-$conquer algorithm that efficiently determines the minimum distance between any pair of drones. Your algorithm should find this minimum distance without exhaustively comparing every pair of drones. Provide a detailed explanation of your algorithm, includingthe pseudo code, and analyze the time complexity ($($Big−$-$Oh notation)$)$ of your proposed algorithm.