Consider the same maze shown above with the same start and goal nodes. Let the heuristic cost of

every node to reach $G$ be:

Table of

heuristic

List the vertices expanded by a $A^{**}$ search $($enter the single letter label of a node$).$

$S$

$B$

there's $3$ Incorrect, answer this and i will give you a thumbs up