Simulate the path finding procedure in the above state space using $($a$)$ BFS and $($b$)$ DFS$.$

Consider $\text{'}$ S $\text{'}$ as the starting state and $\text{'}G\text{'}$ as the goal state. Discuss the following for each of

those search strategies.

$($i$)$ What data structure is required and how it gets updated?

$($ii$)$ What are the advantages and disadvantages of the $($a$)$ BFS and $($b$)$ DFS strategy?