minimal spanning method, manually.

Van Luis LC Tudu L LUS U of cars fron Network for Pro - Steve o wie noun 22 33 zet. When Berli duu acity of two of its roads. If this is done, traffic long road 1-2 (from node 1 to node 2) will be in- eased from 2 to 5, and traffic capacity along road 1-4 will be increased from 1 to 3. What is the maxi- mum number of cars per hour that can travel from east to west with the current road system? If the in- creases in capacity for roads 1-2 and 1-4 were both made, how would that change the number of cars per hour that can travel from east to west? 0.35 The director of security wants to connect security video cameras to the main control site from five potential trouble locations. Ordinarily, cable would simply be run from each location to the main con- trol site. However, because the environment is po- tentially explosive, the cable must be run in a special conduit that is continually air purged. This conduit is very expensive but large enough to handle five cables (the maximum that might be needed). Use the minimal-spanning tree technique to find a minimum distance route for the conduit between the locations noted in the network below. (Note that it makes no difference which one is the main control site.) 0 15 4 9-37 The numt sands of chemical chemical Network for Problem 9-35 Network for Prob 0 27 65 1 52 53