Part D: Code Implementation $(7$ points each$)$

$16.$ Given the state space and heuristic values in the attached figure, demonstrate how the $A^{**}$ search algorithm would work to find the optimal path from $S$ to $G.$

$\backslash$table$[[$State$,h(n)$ make sure to answer correctly!!