Question 1:      

Question 2(continuing from Question 1)

 

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. 76 20 E 44 30 3 11 P 18 F 80 1 5 7 25 6 a 21 K Y 22 6 16 G 32 W S 55 35 13 N B 9 12 M H R 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