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= Ea, h, c. d, e, f} E = [[a, b, 9}, {a, c. Ii}, {a, d, 1}, {a, f, 4], {I}, c. 3}, {I}. f. 8}, {(2. d, 3}. EC, f, 5]. [d, e, 8}, Ed. f. 3}} C d b e a I What is the total weight of a minimum spanning tree of the graph? YourAnswer: :] Answer (2217'. 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: {3, by C! d: E, f! g} E = {{a, b, 10}, {a, c, 12}, ia, d, 15}, ia, f, 9}, [[3, c, 11}, [I], e, 9}, {[3, f, 3}, {-2, d, 11}, EC, g, 12}, id, e, 12], Id, 1', 10}, [f, g, 16}} What is the total weight of a minimum spanning tree of the graph? Your Answer: : Answer Q18C. In what order are the vertices visited in a post-order traversal of the tree below? [Enter answer as a simple string of letters, using no commas or spaces. For example: xyzwvu} \fQ21D. In what order are the vertices visited in a breadth-first search of the tree below? {Enter answer as a simple string of letters. using no commas or spaces. For example: xyzwvu)