Q$9-(10$ marks$)$ Below is a search space with $S$ the start note and $(F$ & G$)$ satisfying the

goal test. Arcs are labeled with the cost of traversing.

$1-$ Draw the portion of the state space.

$2-$ List the order in which nodes will be visited using the following seareh strategies:

a$.$ Breadth First search.

b$.$ Depth First search.

c$.$ Depth Limited with limit $2.$

d$.$ Iterative deeping.

$3-$ Inifialize queve show the path under consideration in DFS$.$

What are the values of Branching factor $b,$ and $d?$

$5-$ What is the depth of this tree?

$6-$ Path cost: