Using the following graph, we want to move from our initial state (A) to the goal state (G): Y Breadth-first search: Depth-first search: Draw search tree and fringe table from A to G based on Breadth-first search. Find the path from A to G based on Breadth - first search. Draw search tree and fringe table from A to G based on Depth-first search. o Find the path from A to G based on Depth-first search. Depth-limited search (L = 2): Draw search tree f and fringe table from A to G based on Depth-limited search. Find the path from A to G based on Depth-limited search.