Recall that when running depth first search on a directed graph, we classified edges into 4 categories: tree edges, forward edges, back edges, and cross edge. Prove that if a graph G is undirected, then any depth first search of G will never encounter a cross edge