Given the below state space graph where the node S is the initial state and

the node G is the goal $($final$)$ state, answer the following questions:

$($a$)$ Draw the equivalent search tree,

$($b$)$ What is the searching order and the solution if we use the depth first search

$($DFS$).$

$($c$)$ What is the searching order and the solution if we use the breadth first search

$($BFS$).$

$($d$)$ What is the searching order and the solution if we use the uniform cost search

$($UCS$)$