Q$5.$ For the given graph, answer the following questions $($consider the modes in ascending order$)$:

$($a$)$ What will be the state of visiting queue while visiting node $6$ with Breadth First Search $($BFS$)?$

$($b$)$ What will be the state of stack while visiting node $6$ with Depth First Search $($DFS$)?$

$($c$)$ If the edge from node $2$ to $3$ is removed, will it affect the implementation of BFS $($True$/$False$)?$