Graph $G$ has multiple distinct MSTs, each of cost $n-1$
From the given data given graph is a complete graph with all edge weights $1$. A MST will contain $n-1$ edges . Hence weight of MST is $n-1$.
The graph will have multiple MST. In fact all spanning trees of the given graph wll be MSTs also since all edge weights are equal.