Correctness Theorem(GeneralMSTAlgorithm) Let a be a subset of e that is included in some mst for g let V, S-V) be any cut of G that respects A, and let(u, v) be a lightest edge crossing V,S-V. Then, auf(u, v)) is included in some MST. Theorem Kruskal algorithm and Prim algorithm correctly find a minimum cost spanning treeCorrectness Theorem Kruskal algorithm and Prim algorithm correctly find a minimum cost spanning tree