Q$4$: Consider the following graph representing the state space and operators of a navigation problem: $S$ is the start state and

$G$ is the goal state.

Build Search tree

Solve the Search problem using DS

Solve the Search problem using BS

Solve the Search problem using Greedy Alg.

Solve the Search problem using A$*$ Alg.