True / False?
1. For a directed graph, the absence of back edges with respect to a BFS tree implies that the graph is acyclic.
2. The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.