Given the binary tree shown below for the problem with the goal node being $6,$ provide the sequence of explored nodes for the following search algorithms, using the format $"x,Y,$dots,$Z"$:

Sbinary.png

If you're having problems viewing the image, here's the text version:

a$)$ Breadth First Search $($BFS$)$:

b$)$ Depth First Search $($DFS$)$: