2. Consider the adjacency matrix of a graph with 3 vertices where weight of each edge is 1: 01 M-1 0 1 110 Choose the correct answer. Graph M has 3 spanning trees of different costs. Graph M has a unique minimum spanning trees of cost 2. Graph M has no spanning tree. Graph M has 3 distinct minimum spanning trees, each of which cost 2. Incorrect Note that all non-diagonal elements in the adjacency matrix are 1. So, every vertex is connected to every other vertex of the graph. Refer to the video "Spanning Trees" to review the concept. 0/1 point