Refer to the graph below $($with path costs and straight$-$line distance heuristic

values$)$:

Work through the evolution of the Depth$-$First Search stack.

What is the order the nodes are visited? $($e$.$g$.($SBA$))$

Work through the evolution of the Breadth$-$First Search queue. What is the order

the nodes are visited? $($e$.$g$.($SBA$))$

Find a path from S to G using Uniform$-$Cost Search. Clearly indicate why a node is

not expanded further.

Find a path from $S$ to $G$ using $A^{*}.$ Clearly indicate why a node is not expanded

further. Upload work here:Consider a case where all path costs are equal. Answer the following:

Is depth$-$first search optimal in this case in terms of path cost?