Please answer 3

A Concepts: Consider the following state space. S is the starting state and G is the goal state. 1) Prove that the heuristic above is admissible. 2) Prove that the heuristic above is not consistent. 3) Apply A with tree search on the above state space. Draw the search tree and highlight the solution path 4) Apply A with graph search on the above state space. Draw the search tree and highlight the solution path