Problem 2: (20 points] Consider the 8-puzzle problem, where the board is 3' 3 and there are eight tiles, numbered 1, 2, 3, 4,5,6,7 and 8. There are four moves: move the blank up, right, down, and left. Use A* algorithm to find the path from start state to the goal state, where h(n)= the number of tiles out of places and g(n) = the actual distance from n to the start state. The start and goal states are: Start 2 83 1 2 3 -N 4 164 7 5 8 7 5 Goal