Q16. 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 = Ha, b, 9}, {3, c, Ii}, {3, d, 1}, {3, f, 4], Ih, c, 4}, {I}, f, 8}, {(2, d, 3}, {(2, f, 5], Id, e, 6}, {d, f, 8}} What is the total weight of a minimum spanning tree of the graph