Need help to answer my questions

MST and Kruskal's Algorithm Name: Property of Trees: A tree with N vertices will have N-1 edges. This graph has 6 vertices so a Minimum Spanning Tree (MST) for this graph will have 5 edges. B 1.0 12 1.4 2.3 3.7 2.6 29 F 5.0 C 2.8 3.1 2.0 1.4 2.5 2.7 E D 1a) Using Kruskal's Algorithm, create a Minimum Spanning Tree for the above graph. Draw the Minimum Spanning Tree in the space below. 1b) List the 5 edges (and their weights) you used in the order you used them to create the MST above. 1st edge used; 2nd edge used: 3rd edge used: 4th edge Activate Windows used: 5th edge used: Go to Settings to activate Wind