Answer should be C) that is graph has multiple distinct MST each of Size (n-1)
Slution:
Consider n=3 .... and let names of nodes are A,B,C so our matrix will be [ 0 1 1 ]
[ 1 0 1 ]
[1 1 0 ]
Now ...We got a Triangle A,B,C in which AB=BC=CA=1 (that is Cost of path/Edge)
Now For Spanning tree We sholud have N nods and N-1 Edges ..So ..Possible Tree Are
1)A-B-C of length 2 that is Ab=1 and BC=1 that 1+1=2 which is (n-1)..
2)B-A-C of length 2 that has BA=1 and AC=1 and total of 2 ...like that ..so we have other tree also like
CAB then CBA the BCA all are of SAME LENGTH that is (N-1) here N=3 so length is 3-1 that is 2.
So Graph has multiple Spanning tree each of COST (N-1)