Which of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph G is/are TRUE?
- AA DFS tree of is a Shortest Path tree of .
- BEvery non-tree edge of with respect to a DFS tree is a forward/back edge.
- CIf is a non-tree edge of with respect to a BFS tree, then the distances from the source vertex to and in the BFS tree are within of each other.
- DBoth BFS and DFS can be used to find the connected components of .

