Given a weighted connected graph $G$, we construct a minimum cost spanning tree $T$ as follows. Choose any vertex $v_0$ in $G$ and include it in $T$. If vertices $S=\{v_0, v_1,\ldots,v_k\}$ have been chosen, choose an edge with one endpoint in $S$ and one endpoint not in $S$ and with smallest weight among all such edges.
° Among all the spanning trees of a weighted and connected graph, the one (possibly more) with the least total weight is called a minimum spanning tree Given the graph G below. 1. Find a spanning subgraph of G and draw it below. 2. Draw all the different spanning trees of G. 3. Of those you had in...