HM$2-2$ DFS and BFS $($DAG$)$

Assuming we have the following graph, strarting from root node $s,$ if we were to traverse all of its nodes, what would the order of visiting be usina Depth$-$First Search $($DFS$)$ and Breadth$-$First Search$($BFS$),$ respectively?

Write your response by hand in the notebook cells, either using a comment $($#$)$ or a markdown cell, for each question.

Note: You can check your answer with Python code, but try to answer without it to enhance your understanding.