Consider the search space shown in Figure 4. G is the only goal state. Costs are undirected. For each of the following heuristics, determine if it is admissible or not. For non-admissible heuristics, modify their values as needed to make them admissible. Heuristic 1: h(A) = 20 h(B) = 15 h(C) = 5 h(D) = 0 h(E) = 5 h(F) = 5 h(G) = 5 Heuristic 2: h(A) = 20 h(B) = 20 h(C) = 20 h(D) = 20 h(E) = 20 h(F) = 20 h(G) = 20 Heuristic 3: h(A) = 2 h(B) = 0 h(C) = 2 h(D) = 0 h(E) = 2 h(F) = 0 h(G) = 2 Heuristic 4: h(A) = 0 h(B) = 2 h(C) = 0 h(D) = 2 h(E) = 0 h(F) = 2 h(G) = 0 Heuristic 5: h(A) = 0 h(B) = 0 h(C) = 0 h(D) = 0 h(E) = 0 h(F) = 0 h(G) = 0

START GOAL Figure 4. A search graph showing states and costs of moving from one state to another. Costs are undirected