$(10$ marks$)$ Suppose A is the start state in the following figure:

$($a$)$ Suppose N is a goal state. Give the list of nodes visited and a solution using DFS and BFS$,$ respectively.

$($b$)$ Suppose P is a goal state. Give the list of nodes visited and a solution using DFS and BFS$,$ respectively.

$(20$ marks$)$

$($a$)$ Implement the DFS algorithm using any language of your choice.

$($b$)$ Implement the BFS algorithm using any language of your choice.

$($c$)$ Test your program using question $5.$ Submit screenshots to show your test.