Question

1. Illustrate the Kruskal's algorithm on the graph I. In addition show how Union-Find data structure changes throughout the algorithm. [15marks) 2. Using Kruskal's algoritm, determine how many minimum spanning

trees (MSTS) the graph I'. [10 marks]

Question image 1Question image 2Question image 3