a. Given an undirected graph G = (V, E) and a subgraph T = (V' , E') where V' = V, E' E, that is a tree. Design an algorithm to find whether T could have been the output of running DFS on the original graph. from some starting vertex. b. As the above. But now, design an algorithm to find whether this subgraph T could have been the output of running BFS on the original graph.