2. We know that a connected tree has n-1 edges where n= |V]. We will define an almost-tree to be a connected graph, G = (V, E), with at most n+c edges for a constant c where n= |V]. Give an algorithm with O(n) running time that finds a minimum spanning tree of an almost-tree. You may assume all edge costs are unique