For the problem shown in Fig. $2,$ show that the heuristic is admissible

$($h$($n$)<=$ h

$$

$($n$)$ for all n$).$ Actual cost from node to node are shown as edge labels. The heuristic function

value for each node is shown in a spearate table to the right. Note: You have to compute h

$$

$($n$)$ for each n

and compare to the h$($n$)$ table.