Define a heuristic $h$ for the problem above as $h(n)=15-n.$ dieafly $h(n)0,$ and $h(G)=0,$ where $G,$ the goal, is $15).$ Suppose each operator costs $1$ unit.

a$)$ Draw ther tench tren and thosi the noter in which the nodes are wsited using If GBrs

ii$)A^{**}$

ii$)$

Hil$-$ci mbing

ii$)$ is the heuristic admissisable?epl explain why.

use atl least $6$ books $($harHarvard style of referencing$)$