Use Kruskal's Algorithm to find the minimum spanning tree $($MST$)$ for the weighted graph. Give the total weight of the minimum spanning tree.

Which of the following trees matches the shape of the minimum spanning tree?

B$.3.,D$

$$ D$.$

What is the total weight of the minimum spanning tree?

The total weight is $$

$($Type a whole number.$)$