Question $3,[20$ marks$]$

Given the following search graph, write the sequence of node numbers in the search agenda across the search life$-$time and using$$A$*$ search.

Assume the following heuristic value per node:

Node ID

Node Heuristic value

$1$

$0$

$2$

$180$

$3$

$219$

$4$

$276$

$5$

$453$

$6$

$314$

Assume distance between cities are as mentioned on the links

Apply A$*$ algorithm showing intermediate values for the Agenda, g$($n$),$ h$($n$)$

Source city is :C$6$

Destination city:C$1$

$$

a$.$ Evaluate the A$*$ algorithm in the light of the task solved in a$.$