Spanning forest is a subset of a graph (V,E).
Edge costs: Ce.
Compute:
a) Assume Ce in Z. Give an algorithm that finds the MSF (minimum spanning forest), show correctness and running time of this algorithm.
b) Assume Ce in N. Give an algorithm that finds the MSF, show correctness and running time of this algorithm.