13. Use Kruskal's algorithm to find the minimum spanning tree in the following graph. Draw the MST in the graph provided

[answerhappygod]

13 Use Kruskal S Algorithm To Find The Minimum Spanning Tree In The Following Graph Draw The Mst In The Graph Provided 1 (57.24 KiB) Viewed 25 times

13. Use Kruskal's algorithm to find the minimum spanning tree in the following graph. Draw the MST in the graph provided and indicate the order in which the edges are added. A 30 F A F TI 12 9 18 B 10 G 6 B 5 G 2 8 C 13 H C 11 a) (1 marks) Draw MST here, including weights of added edges: H 1 7 4 b) (1 mark) What is the total weight of the MST? D 15 I D I 4 8 1 E 9 J E J c) (3 marks) In what order were the edges added? Give your answer as a list of vertex pairs. I.e. (AF), (CH), (AB), etc.