Q$3.$ Consider the graph below which represents a simple undirected graph. You need to find a path from node A to node E$.$ Analyze the graph and answer the following:

$($CLO$3$:S$1=3$ marks, $S2=3$ marks, $S3=2$ marks, $AR1=2$ marks$)$

Part A: Describe how Breadth$-$First Search $($BFS$)$ would traverse this graph from node A to node $E.$

Part B: Describe how Depth$-$First Search $($DFS$)$ would traverse this graph from node A to node $E.$

Part C: Describe how Iterative Deepening Search $($IDS$)$ would traverse this graph from node $A$ to node $E.$

$A$

$M$

$BC$

$\frac{M}{\text{I}}$

DEF

D E F

Part A: Breadth$-$First Search $($BFS$)$:

Nodes path Visited to E:

Explanation:

Part B: Depth$-$First Search $($DFS$)$:

Nodes Path Visited to E:

Explanation:

Part C: Iterative Deepening Search $($IDS$)$ to Level$2$:

Depth $0$:

Depth $1$:

Depth $2$:

IDS Explanation: