Question 2:

 

Question 1 Imagine you are working with Civil Engineers to repair a road network connecting 22 cities together which has been damaged by floods. The cost associated with maintaining the road network is shown in Fig. 1. 30 20 76 11 44 W 21 55 12 R 8 H 1 7 22 18 5 25 16 35 13 M 7 Fig. 1: Damaged Road network and the cost of visiting each city Using Fig. 1 as reference, implement an algorithm which estimates the minimum cost of keeping the cities connected despite the damage. (Note: Treat the damaged road network as one disconnected graph; NOT as two separate graphs.) Code Input: Code Output: Fig. 1 (using any graph representation) Number of sections and list of edges in each section whose sum make up the minimum cost of keeping the cities connected 10 Example Input: 20