Given an undirected graph with costs on edges, assume that all pairs of edges are pairwise different. Show that there is a unique minimum spanning tree. In all the algorithms, always explain their correctness and analyze their complexity. The complexity should be as small as possible.