Solve the problem.A large city is planning to upgrade its existing downtown water distribution system. Water will be fed into the area at the point represented by the vertex labeled A in the graph below. Water must be piped to each of 5 main distribution points, represented by the vertices B through F in the graph. City engineers have estimated the cost of laying the pipes to carry the water between each pair of points in millions of dollars, as indicated on the graph. They must now select which pipes should be laid, so that there is exactly one route for the water to be pumped from A to any one of the five distribution points (possibly via another distribution point), and they want to achieve this at minimum cost. Use Kruskal's algorithm to determine which pipes they should lay. Find

Question

the total cost of laying the pipes you select.



What will be an ideal response?

Answer 1