Question - Find a connected graph G(V, E) that has two spanning trees T1 and T2 such that any sequence of swaps of edges which transform T1 into T2 through a sequence of intermediate spanning tress has the property that the corresponding sequence of weights of those intermediate trees is not monotonic. (Note: the spanning trees do not have to be minimum spanning trees.)