Let us call a graph G tree-close if m = n+ 20, where n is the number of nodes and m is the number of edges of G. Design an algorithm that takes a tree-close graph G as input (and the costs of the...

Let us call a graph G tree-close if m = n+ 20, where n is the number of nodes and m is the number of edges of G. Design an algorithm that takes a tree-close graph G as input (and the costs of the edges of G) and outputs a minimum spanning tree of G. The running time of your algorithm should be O(n) (where n is the number of nodes of G).