1. You are given the task of implementing either BFS or DFS fora wide graph. Which algorithm would be ideal for low spaceutilization? What about a deep graph where solutions are notcommon? Explain.
2. The path that DFS and BFS take through a graph can berepresented as “tree”, where the tree contains all of the nodes inthe original graph but only the edges which the algorithms used tofind new nodes. (That is, the tree only contains only edges in theedgeTo array.) Decribe a graph for which BFS and DFS generateidentical exploration trees.
3. Consider a graph algorithm with a growth function on
OR
OR