5 A В 13 D Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. Which of the edges below are included in the minimum cost tree? BC O AB BD AD O AC OCD

Gis a connected graph with 32 vertices and 41 edges A spanning tree for G has vertices and edges

U B BD □AC CE 0 BE AE CD AD ⒸAF OCF 15. AB ODE ODF BC BF EF 10 Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. Which of the edges below are included in the minimum cost tree? ریا T E D

4. Find a minimum cost spanning tree on the graph below using Kruskal's algorithm. 20 7 13 14 17 21 9 3 18 12 19 8 16 15 11 22 1 10 2 Create a minimum spanning tree using Kruskal's algorithm. What is the total minimum length of the spanning tree?