Consider a very sparse undirected weighted graph G = (V, E), in particular for which |E||V| = 10. Give an O(|V|) time algorithm for finding a minimum spanning tree on G and prove your algorithm correct.