Consider the graphs below. In what order does BFS$,$ DFS and UCS expand the nodes for each graph

$($assume that nodes are added to the stack$/$queue in alphabetical order$)?$ Provide answers for both

the tree and graph versions of the algorithms. That is$,$ write out the stack$/$queue at each step of the

algorithm along with the nal path returned. The agent starts at node s and must reach node g$.$