We are given an undirected graph, that is connected. We're also given that each edge is associated with a positive weight. Now, we want to make this graph acyclic by removing some edges. Find this set...

We are given an undirected graph, that is connected. We're also given that each edge is associated with a positive weight. Now, we want to make this graph acyclic by removing some edges. Find this set of edges by designing an algorithm. Note: this edge set should have the smallest total weight out of other potential edge set solutions. The algorithm should run in O((m + n)log n) time.