Q$.1($a$)$ List and explain in brief various heuristic search algorithms used

in artificial intelligence.

$($b$)$ For the graph shown in Figure $1,$ let the start and goal node as $S$

and $G,$ respectively, and the heuristics of each node as $h(S),h(A),$

$h(B),h(C),h(D)$ and $h(G)$ as $5,3,4,2,6,0,$ respectively. Explain the

working of $A^{**}$ search algorithm for this scenario.

Figure $1$