Q$1$ BFS$/$DFS$/$IDS $(5$ points $3=15$ points$)$

Assume that you obtained a treasure map, where you start from your house $($node $S)$ and the goal is a treasure box

$($either $G_1$ or $G_2).$

You are going to find a path to a treasure box using different search strategies.

If there are multiple choices of edges at a node, select the north ones first.

For example, at node $S,$ node $C$ will be tried first among $C,E,$ and $A.$

Please show the solution path and the search process step by step, as shown in the lecture slides. Please specify which

search strategy it is$.$

PS$.$ You can draw by hand and then take pictures or draw using tools like PowerPoint.

$1-1$ BFS $($breadth$-$first search$)$

$1-2$ DFS $($depth$-$first search$)$

$1-3$ IDS $($iterative deepening depth$-$first search$)$