The tree to the left represents the A$*$ Search Tree that would be generated during $A^{**}$ tree search $($i$.$e$.,$ without memoization for repeated states$),$ with the evaluation $f(n)=g(n)+h(n)$ of each node $n$ listed next to each is the black number and $h(n)$ the red$).$

Notably, the optimal solution will be discovered in this example, even though the state $C$ will be expanded twice during the search.

$4\mathrm{.}3.$ Provide the order in which $A^{**}$ Graph Search would expand its search tree, remembering that graph search memoizes states that it has previously expanded such that it will never expand nor generate them in the future.

$\backslash$table$[[\backslash$table$[[$Order of$],[$Expansion$]],$State $/$ Node, $n,g(n),h(n),f(n)$