Question 1 [10 marks): Th costs for all the possible options to construct the roads for connecting a pair of cities is shown in the following table: Pair of cities Cost (A,B) (B,C) (C, D) (CE) (A,C) (AF) (B, E) (F, D) (E, D) Draw a graph to model the problem and then use Kruskal's algorithm to find the roads to be constructed such that all the cities are connected and the total cost is minimum. You must show the sequence of edges added when you apply the algorithm and the minimum cost for constructing all the roads. 2 3 2 7 4 3 5 6 7