Problem Description

You are given the following graph:Edges:A$-$B$,$ A$-$CB$-$D$,$ B$-$EC$-$FE$-$G$-$F$-$H

Solve the Problem Using Breadth$-$First Search $($BFS$)$

Apply BFS to find the path from node A to the goal node $H.$

Show the state of the queue at each step $($use a table for illustration$).$

What is the final path found by BFS$?$

Solve the Problem Using Depth$-$First Search $($DFS$)$

Apply DFS to find the path from node A to the goal node $H.$

Show the state of the stack at each step $($use a table for illustration$).$

What is the final path found by DFS$?$