6, (20 points) Let G = (V,E) be an undirected weighted graph, and let F C E be a collection of edges in G that contain no cycles (i.e. they form a forest). Design an efficient algorithm to find a spanning tree in G that contains all the edges in F and has minimum cost among all such spanning trees