question: Find the minimum spanning tree of the graph G(V, U) of figure 1. Notice that it is an undirected graph.
  <image 1>
  Options: A: Graph G1 with vertices v1 to v8 and arcs including (v1, v3), (v2, v3) and so on., B: Graph G2 with vertices v1 to v8 and arcs including (v2, v5) and (v4, v8)., C: Graph G1 with vertices v1 to v8 and arcs excluding (v2, v5) and (v4, v8)., D: Graph G2 with vertices v1 to v8 and no arc connecting A1 and A3.