need help with these questions, explanation to all questions will help

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 = {3, b, c, d, e, f} E = {{a, b, 9}, {a, c, 6}, {a, d, 1}, {a, f, 4}, {b, c, 2}, [b, f, 8}, {c, d, 3}, {c, f, 5}, {d, e, 4}, {d, f, 8}} What is the total weight of a minimum spanning tree of the graph? Your Answer: Answer Q17. 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. g} E = {{a, b, 10}, {a, c, 12}, {a, d, 15}, {a, f, 8}, {b, c, 11}, {b, e, 9}, {b, f, 5}, {c, d, 11}, {c, g, 13}, {d, e, 12}, {d, f, 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) \"ft