Problem $4-$ A$*{?}^{**}$ Heuristic Design

Suppose we have the following State Space Graph of an arbitrary search problem with Initial State I and Goal State $G.$ Path costs are indicated along the edges of each transition, and the heuristic estimates of some heuristic $h$ are indicated alongside each state $/$ node $($in red$).$

$4\mathrm{.}1.$ Complete the following table to prove whether or not the heuristic, $h,$ in the state space graph is admissible $($the first row is done for you$)$:

$\backslash$table$[[$State $/$ Node, $n,h(n),h^{**}(n)$