How many MST is possible?

Question

Given graph using Prim’s or Kruskal’s algorithm, find out that how many distinct minimum cost spanning trees are possible___?

My answer was 1 and given is 2  ,what I am missing ?

  

Edit:I had confirmed with it and answer is only one tree possible.

Answer 1

Yes....I m also getting 1 tree only !

Comments

If..edges having weight 10 would have been on same  side , and 20 weight edges also...then .. possibility would have been ,to get 2 Min Span trees!