Consider the graph in Figure $1.S$ is the start node and $G$ is the goal, and we need to find

the path with minimum cost. Table $1$ contains the heuristic table.

Table $1$

Figure $1$

$($a$)$ Find the path using $A^{**}$ algorithm where in each expanded path to $G,f=g+h.$ Show

all the steps.

$(5$ Marks$)$

$($b$)$ Show how to find the path using best$-$first search algorithm Using $h$ as a reference

for finding the path.

$($c$)$ Compare between the results in $1($a$)$ and $1($b$)$