Show a BFS traversal of the following tree by giving the contents of the queue

after each step $($similar to the example in the relevant lecture slides$).$

Remember to empty the queue in the end.

Show a DFS traversal of the following tree by giving the contents of the stack

after each step $($similar to the example in the relevant lecture slides$).$

Remember to empty the stack in the end.