QUICKLY PLEASE...

a. (15 Points) (Minimal Spanning Tree Method) The CCP Company needs to connect 8 mainframe (A-H) computers with cables in a network as shown in the Figure below. The network can take any form as long as each computer is connected with at least one other computer. All physically possible connections between nodes are shown in the figure below with distances in kms indicated at each cable. Realize the network at minimum cost, which means a minimal total length of cables. 300 B 500 200 400 300 200 300 (E 500 f D 500 400 200 1600 (H) b. (15 Points) (The Shortest Route Network) The CCP Company needs to drive their cars from the city A to other 7 cities (B-H). Determine the shortest path between starting node A to the other 7 nodes. All physically possible connections between nodes are shown in the figure below with distances in km.s indicated between each cities. 300 B 500 A 200 400 300 200 300 E 500 (F 500 400 200 1600 (H)