$($a$)$ Compare and contrast Breadth$-$First Search $($BFS$)$ and DepthFirst Search $($DFS$)$ algorithms.

$($b$)$ Design a valid BFS sequence of node for following graph.

$($c$)$ Design a valid DFS sequence of node of above graph with the source node as $N.$