A* concepts. Consider the following state space. S is the starting state and G is the goal state. h = 1 h = 0 4 B 6 4 G S D h = 8 h = 1 6 C h = 7 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