Q$1($a$)$

Compare and contrast the two search algorithms: Breath$-$First Search $($BFS$)$ and Depth$-$First Search $($DFS$).$

Q$1($b$)$

$[8$ Marks$]$

Given the following graph:

$-$ What would be the result of executing BFS and DFS on the graph above when starting at node $"$A$"?$

Q$1($c$)$

Suppose you are searching for the path from A to H $.$ Which of the two algorithms, BFS or DFS would be the quickest to find this path $($A to H$)?$ Justify your answer.