Hello! I need assistance for the following:

A fiber-optic cable line is to be installed along highways connecting six cities. The highway distances, in miles, between the cities are given in the following table. Complete parts (a) and (b) below.

a. Model this information with a weighted, complete graph. Choose the correct graph below.

b. Use Kruskal's Algorithm to find a minimum spanning tree that would connect each city using the smallest amount of cable. Determine the total length of cable needed. Choose the correct minimum spanning tree below.

c. Determine the total length of cable needed.

\f