Find MST of unfinished graph/tree in O(n)

Question

Question: We know that a connected tree has n−1 edges where n = |V|. We will define an unfinished-tree to be a connected graph, G = (V, E), with at most n+c ed