資料結構與演算法

(5%) Using Kruskal's algorithm, calculate the total cost of the minimum spanning tree (MST) for the graph shown.

The graph has vertices $A, B, C, D, E$ with the following weighted edges: $A\text{-}B = 4$, $A\text{-}C = 2$, $B\text{-}C = 1$, $B\text{-}D = 3$, $C\text{-}D = 5$, $C\text{-}E = 6$, $D\text{-}E = 2$.