Figure $2$: A field map with eight nodes. Value next to each edge denotes actual cost between two

nodes. Heuristic value of each city is given in Table $1.$

Table $1$: Heuristic values $h(N)$ of each node to the goal $(G)$ node.

$[1\mathrm{.}5$ pts$]$ Figure $2$ shows a roadmap with four cities. The value next to each edge denotes the

actual distance between two nodes. The heuristic value of each city is given in Table $1.$

a$.$ Use greedy Best$-$First Search to create a search tree to find path from source node S

to the goal node G$.$ The three must show f$($N$)$ value of each node, and report final

path discovered by the Best$-$First Search $($either highlight the path on the tree, or

report the path separately$)[0\mathrm{.}75$ pt$]$

b$.$ Use A$*$ Search to create a search tree to find path from source node S to the goal

node G$.$ The three must show f$($N$)$ value of each node, and report final path

discovered by the Best$-$First Search $($either highlight the path on the tree, or report

the path separately$)[0\mathrm{.}75$ pt$]$