What are the space efficiencies for depth-first search and breadth-first search of a graph? How much extra space we used to implement this search? Sometimes this question solves differently depending on the structure of a particular graph and which algorithm is applied. Write a detialed explination of this problem with examples(graphs) for both dfs and bfs, including the the space requirements for each type of search.