Suppose we perform a breadth-first search of an undirected graph and build a breadth-first spanning.

Suppose we perform a breadth-first search of an undirected graph and build a breadth-first spanning tree. Show that all edges in the tree are either tree edges or cross edges.