A company plans to build a communications network connecting its five computer centers. Any pair of these centers can be linked with a leased telephone line. Which links should be made to ensure that there is a path between any two computer centers so that the total cost of the network is minimized? Use following graph for this problem. (Hint: Use Prim's Algorithm to find minimum spanning tree and answer the question.) 1. Detroit SIN San Francisco 5359 5279 1.79 New York 56 $209 Los Angeles Denver -End of Tutorial