This proof was done in class and will be on the test on Friday but I just don't understand it. Can someone save me please. Thank you.
1) Prove that if T1, T2 and T3 are spanning trees of a simple connected graph G then:
d(T1, T3) <= d(T1, T2) + d(T2, T3):