Multiple Minimum Spanning Trees in a connected undirected weighted graph

Question

how do I get all the MSTs in one graph ? I unable to understand the concept of all minimum spanning trees possible in a single graph. I do not even understand how to draw multi