Consider the graph shown below. In what order does A$*$ and Greedy search expand the nodes for the

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 final path returned. The agent starts at node s and must reach node g$.$

$[3$ points each for a total of $12$ points$]$