Prove that every connected graph which is not itself a tree must have at last three different (although possibly isomorphic) spanning trees.