computer networks should avoid single points of failurethat isnetwork nodes that can disconnect the network if they fail we say connected graph is biconnected if it contains no vertex whose removal would divide into two or more connected components give an ( )-time algorithm for adding at most edges to connected graph gwith > vertices and > edgesto guarantee that is biconnected - nasa wants to link stations spread over the country using communication channels each pair of stations has different bandwidth availablewhich is known priori nasa wants to select channels (the minimum possiblein such way that all the stations are linked by the channels and the total bandwidth (defined as the sum of the individual bandwidths of the channelsis maximum give an efficient algorithm for this problem and determine its worstcase time complexity consider the weighted graph ( , )where is the set of stations and is the set of channels between the stations define the weight (eof an edge in as the bandwidth of the corresponding channel - suppose you are given timetablewhich consists ofa set of airportsand for each airport in aa minimum connecting time (aa set of flightsand the followingfor each flight in forigin airport (fin destination airport (fin departure time (farrival time (