the goal state.

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 values

$h,h(n)$

A $5\mathrm{.}1$

B $,4\mathrm{.}1$

C $,3\mathrm{.}9$

D $4$

E $,2\mathrm{.}2$

$F3\mathrm{.}8$

G $,0$

$H,3\mathrm{.}7$

J $7$

K $6$

L $,4$

$M0\mathrm{.}5$

$N,1\mathrm{.}5$

$P1\mathrm{.}8$

$S,4\mathrm{.}5$

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

S

B