5.9.3 Minimum Spanning Tree A cable TV company needs to run some wires to serve six customers who are located a considerable distance apart. The following symmetric table gives the cost (in tens of dollars) of running a direct cable between customers an impossible or prohibitively costly connection is indicated as-> 270 CHAPTER 5. NETWORK MODELS From/To 1 2 3 4 5 6 1 3941 62 40 239 50 38 60 65 341 50 35 36 61 4 62 38 35 32 48 540 60 36 32 46 6 65 61 48 46 (a) Draw a picture of the six customers, showing each potential connection with its cost written next to the link. (b) On this picture, beginning with customer 1, use the visual algorithm to find the minimum cost solution