In the following graph, $a$ is the start node and $e$ is the goal node. Each node $n$ is labelled with the

values for $f(n)$ and $h(n),$ listed as a pair $f,h.$ Remember that $f(n)=cost(n)+h(n).$

Given this information, determine the cost of each arc. The cost of arc $a-c$ has already been listed for

you $($it has a cost of $2).$ Label the arcs in the diagram.

Is the heuristic $h$ admissible? Why or why not?