$A^{**}$ frontier until the optimal solution is found on the compl

Complete the following:

The heuristic value for node $A$ is

The heuristic value for node $D$ is

The heuristic value for node $E$ is

There is an edge from

with cost $4$

There is an edge fron

with cost $10$

There is an edge fron

A to $C$

with cost $3$

There is an edge fron

$B$ to $A$

$B$ to $G$

with cost $1$

There is an edge fron

$C$ to $B$

D to $E$

with cost $9$

$E$ to $A$

$E$ to $G$

$E$ to $S$

$S$ to $A$

$S$ to BConsider the following search graph in which the initial state is $S($the square node$)$ and the set of goals is $\{G,F\}($grey nodes$).$ Some edges and

heuristic values have been deleted, and you must reconstruct the original graph with correct heuristic values. To help you with this, we provide you the

frontier of a graph$-$search version of A$*$ at each step over the original graph with heuristic $h.$ Note that $h$ is admissible but inconsistent. Also, none of

the deleted edges start from a goal state.

$A^{***}$ frontier until the optimal solution is found on the complete version of the graph above using as heuristic the number inside the nodes: