Page 299 Exercise 7

Assume that T is a properly constructed spanning tree of G.  This means that T must contain all of the tree edges of G.  Any new edge introduced in T must be a member of the set of back edges.  As Page 292, Problems 12 demonstrated, a back edge always creates a cycle since it connects two vertices already in the tree.