Question: Show that it is possible to find a sequence of spanning trees leading from any spanning tree to any other by successively removing one edge and adding another. A rooted spanning tree of a directed graph is a rooted tree containing edges of the graph such that every vertex of the graph is an endpoint of one of the edges in the tree.