Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true?

• A. graph m has no minimum spanning tree
• B. graph m has a unique minimum spanning trees of cost 2
• C. graph m has 3 distinct minimum spanning trees, each of cost 2
• D. graph m has 3 spanning trees of different costs