Q2 7 Points Consider the state space search problem shown below, where the cost of each transition is given by a number next to the corresponding arrow. For example, the cost of state transition from C to G is 2. In addition, we are given two heuristic functions hj and h2 whose values for each node are specified in the table in the right. Node hh2 5 2 3 A B S B D G 10 4 6 1 12 0 8 3 2 10 6 0 4 Q2.1 1 Point Which of the heuristics shown is admissible? Ohi O h2 Both Q2.2 4 Points Select the path that the A* search will return using each of the heuristics: hi: OS + A + B + G OS + A + C +G OS + D + B + G h2: OS + A + B + G OS + A + C +G OS + D + B + G Q2.3 2 Points Select the path that the greedy search return using h2. OS + A + B + G OS + A + C + G OS + D + B + G