Consider the graph with the following vertices, edges, and weights (weights are stated as the third entry for each edge in E, with the first two entries representing the vertices joined by the edge): V = {a, b, c, d, e, f} E = {{a, b, 9}, {a, c, 9}, {a, d, 1}, {a, f, 4}, {b, c, 7}, {b, f, 8}, {c, d, 3}, {c, f, 5}, {d, e, 6}, {d, f, 8}} What is the total weight of the minimum spanning tree of the graph? There are edges between a and b, a and c, a and d, a and f, b and c, b and f, c and d, c and f, d and e, d and f.