Answer
The minimum spanning tree includes the three edges AC, AD, and BD.
The total weight of the minimum spanning tree is 84.
Work Step by Step
We can use Kruskal's Algorithm to find the minimum spanning tree for the weighted graph.
First, we choose the smallest weight, which is 17. We add the edge AC to the spanning tree.
The next smallest weight is 28, so we add edge AD to the spanning tree.
The next smallest weight is 39, so we add edge BD to the spanning tree.
The minimum spanning tree includes the three edges AC, AD, and BD.
We can find the total weight of the minimum spanning tree.
total weight = 17 + 28 + 39
total weight = 84
The total weight of the minimum spanning tree is 84.
