Question $2$: Search

$[22]$

Consider the following state graph. the start node is $L$ with the aim to reach node V$.$ Numbers on the edges indicate the path cost to get from the one node to the next. RED numbers $(h=8,$ for example$)$ next to the node indicate the heuristic estimate to get to $V.$

$($a$)$ Perform an $A^{**}$ search on the state space above. The start node is $L$ and the goal node is $V.$ For each step of the algorithm, show:

the node that gets expanded

the current path

the Frontier with $f,g$ and $h$ values

Use the heuristic values and path costs as indicated on the graph.

The first iteration of the algorithm gives:

Node Expanded: L

Current Path: L

Child M: $f=10,g=3,h=7$

Child N: $f=10,g=2,h=8$

Frontier: $M(f=10,g=3,h=7),N(f=10,g=2,h=8)$

$(22)$