We define D-Tree(G) as the tree obtained by applying the DFS algorithm on a graph G.
Consider the following statements regarding the same.
S1 : If G is an undirected graph, then every edge in D-Tree (G) is either a tree edge or a back edge.
S2 : If G is a undirected graph, then every edge in D-Tree(G) is either a tree edge, or a cross edge.
Which of the above statements are true ?