Problem 3 Bfs Dfs 20 Pts C Show Tree Produced Depth First Search Run Gs Starting Root0 0 U Q37055116

Problem 3: BFS/DFS [20 pts) (c) Now, show the tree produced by Depth First Search run on Gs starting at root0,0) using this new adjacency list repre- sentation (d) Now, do the sam for the tree produced by Breadth First Search run on Ge- In this problem you wl have todscribe the depth and breadth first search trees caleunlated for particular graphs. Let graph Gn be the nx n grid containing the n2

OR

 

OR