USE JAVA PSUEDOCODE OR A STEP BY STEP EXPLAINATION OF THE ALGORITHM

NASA wants to link n stations spread over the country using communication channels. Each pair of stations has a different bandwidth available, which is known a priori. NASA wants to select n-1 channels in such a way that all the stations are linked by the channels and the total bandwidth is the maximum. Design an efficient algorithm to solve this problem in O(n log n) time.