$($b$)$

$($i$)$ Design an algorithm to solve the graph above taking into consideration the cost

and the heuristic of each node

$[3$ Marks$]$

$($ii$)$ Apply the algorithm you designed in $($i$)$ to generate an optimized search path from

$1$ to $12.$

$[3$ Marks$]$