NASA wants to link n stations spread over the country usingcommunication channels. Each pair of stations has a differentbandwidth available, which is known a priori. NASA wants to selectn-1 channels (the minimum possible) in such a way that all thestations are linked by the channels and the total bandwidth(defined as the sum of the individual bandwidths of the channels)is maximum. Give an efficient algorithm for this problem anddetermine its worst-case time complexity.
Answer
Answer:-
From the given data we can see that the problem is ofMaximum spanning tree. The requiredpseudocode for the given problem is shown below. Thebelow algorithm will
OR
OR