Illustrate an execution of the algorithm -At first all vertices are all separated. Little by little,they merge 5 into groups. Groups merge into larger groups. Finally,all groups merge into one. o That's the spanning tree outputted by the algorithm. 10Illustrate an execution of the algorithm ◼ At first all vertices are all separated. ◼ Little by little, they merge into groups. ◼ Groups merge into larger groups. ◼ Finally, all groups merge into one. ◼ That’s the spanning tree outputted by the algorithm. 6 1 5 4 6 5 4 2 4 3 4 2 6 10