Please analyze this problem and get some ideas on worse case for both dfs and bfs. Also what will the average case be?

What are the space efficiencies for depth-first search and breadth-first search of a graph? That is, how much eztra space is needed to implement the search? The answer depends on the structure of the particular graph to which the search algorithm is applied. And the answer can be different for breadth-first. and depth-first search