Chapters $7,14,$ and $15$

Use Kruskal's Algorithm to fing 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?

A$.$

c$.$

B$.$

D$.$

What is the total weight of the minimum spanning tree?

The total weight is $$

$($Type a whole number.$)$