based on the diagram above:

please help with the following question:

Assume a heuristic function is assigned such that h(n) is the length of the shortest path between n and the closest goal.

Therefore, each goal node has h(n) = 0, their parents have h(n) = 1, and so on. A node that has no path to a goal has h(n) = .

Thoroughly explain why h is guaranteed to be admissible and consistent on this graph, and propose a simple change to one or more of the action costs that would make h inadmissible