Problem 2. (30pts) You are given the initial state (a) and the goal state (b) of an 8-puzzle as shown below. 2 83 164 5 1 | 2 | 3 8 4 7 | 6 | 5 7 (a) (b) a) (20 points) Apply A* using Manhattan distance heuristic function. Draw the search tree including possible expanded states during the algorithm procedure. Compute the triple (g, h, f) for each state. Mark the optimal strategy found. Problem 2. (30pts) You are given the initial state (a) and the goal state (b) of an 8-puzzle as shown below. 2 83 164 5 1 | 2 | 3 8 4 7 | 6 | 5 7 (a) (b) a) (20 points) Apply A* using Manhattan distance heuristic function. Draw the search tree including possible expanded states during the algorithm procedure. Compute the triple (g, h, f) for each state. Mark the optimal strategy found