The figure below shows a search-space graph, where A is the initial state and G denotes the goal. Edges are labeled with their true cost. We have a heuristic function, f(), written in the standard form: f(n) = g(n) + h(n) where g(n) is the cost to get from A to n and h(n) is an estimate of the remaining distance to G.

a. Explain why h is or is not admissible.

b. Explain why h is or is not consistent.

h=2 h=1 2 h=2 1 B C 2 A 2 h=0 G 1 D E 2 1 n=1 h=2