Answer:
99
Step-by-step explanation:
Kruskal's Algorithm has you add edges in order increasing weight, skipping ones that create loops.
__
The order of increasing weights for this graph is ...
10, 12, 14, 16, 18, 22, 24, 25, 28
The edges that can be added without creating loops are shown in bold.
The weight of the minimum spanning tree is ...
10 +12 +14 +16 +22 +25 = 99
