there computer network consist n node number 1 n there link network connect pair nod a pair nod multiple link node link itselfeach link support unlimited bandwidth direction link transmit single direction give time the cost send datum link proportional square bandwidth specifically link positive weight cost send datum link weight time square bandwidthThe network connect series link node node furthermore design remain connected event single node failureYou need send data node 1 node n bandwidth positive number k that wish assign bandwidth link bandwidth node minus bandwidth node k node 1 k node n 0 node the individual bandwidth need integerswishing minimize total cost draw diagram network give task intern solve the intern claim solved task write optimal bandwidth diagram spill coffee render unreadable include part original diagram value kFrom information available determine intern solution optimal that determine exist valid network total bandwidth optimal solution superset give information furthermore determine efficiency intern solution possible efficiency define total cost divide total bandwidth