Is it possible for a graph to have two different minimum spanning tree I am suppose to create a minimum spanning tree from this graph below



I got this answer



However this is my textbook answer



Based on what i have learnt , I think my answer and the textbook answer would both be acceptable however I would like assurance from the community that both the answers are acceptable and I did not miss anything out 

Thanks
It is possible to have different minimum spanning trees for a graph. 
Consider a simple example: a cycle graph with all weights equal. Removing any edge from the graph produces a minimum spanning tree for the cycle graph.