2 Informed Search Figure 2: Informed Search. Problem 6 (Written; 5 pts): For the problem shown in Fig. .2, show that the heuristic is admissible (h(n)h(n) for all n ). Note: You have to compute h(n) for each n and compare to the h(n) table. Hint: It is best to work backwards from the goal, where h(I)=0 (already at goal), h(D)=23 (true minimum cost from (D) to (I), h(D)=23+51=74 (true minimum cost from (D) to (I): note that there is another path and (D) to H to (I) has the minimum cost!), etc