3. Kruskal's Algorithm For A Given Graph – If All Edge Weights Are Distinct, The Minimum Spanning Tree Is Unique. If Two Or More Edges Have Same Weight, Then We Have To Consider All Possibilities And Find Possible Minimum Spanning Trees. 2 2 2 2 2 1 1 N 2 A. The Number Of Distinct Minimum Spanning Trees For The Weighted Graph Is (A) 4 (B) 5 (C) 6 (D) 7 B. Do

 

3. Kruskal's algorithm for a given graph If all edge weights are distinct, the minimum spanning tree is unique. If two or more edges have same weight, then we have to consider all possibilities and find possible minimum spanning trees. 2 2 2 1 1 2 1 1 2 2 2 a. The number of distinct minimum spanning trees for the weighted graph is (A) 4 (B) 5 (C) 6 (D) 7 b. Do they all have the same MST value? If so, why? If not, what are the values?