1. Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed, with ununiformed weights.) A, h=3 B, h=4 D, h=10 h= 2 F, h=0 G, h=0 H, h=2 (2). Is the search heuristic h used in the problem above admissible? Explain your answer. Yes/No. Because: (3). Is the search heuristic h used in the problem above consistent? Explain your answer. Yes / No. Because