The number of vertices in the graph is 6. So the number of edges in the MST will be 5.

A) {(n1,n2,2),(n1,n6,3),(n2,n4,4),(n3,n4,7),(n4,n5,9)} and {(n1,n2,2),(n1,n6,3),(n3,n4,7),(n4,n5,9),(n4,n6,4)}

B) Number of distinct minimum spanning trees is 2.

C) Yes. It’s 2.

D) Yes. It’s 9.

-------------------------------------------------------------------------------------------------------------------------------------------------------------------

Assumption:

C)Is the minimum among the edge weights of a minimum spanning tree unique over all possible minimum spanning trees of the graph?

If we consider the gate question to be correct: options C and D will be False. Because of duplicate edge weights.