Introduction to Algorithm

3. (From Section 23.1) Find a minimum spanning tree for the graph below, using any method. You don't have to show your work, but partial credit may be easier to assign if you do. You only need to specify which edges are in the MST. 3 4 4 2 6 8