Artificial intelligence Heuristic

2) Use A* search with an admissible heuristic to solve the following 8-puzzle problem. In your answer show: i) Tree searched using A* search with actual board configurations as nodes and evaluation function values next to each node, i.e. values of g(n), h(n) and f(n). Use the following order of operators: blank moves left, up, right, down. ii) Order in which nodes were expanded. iii) Final solution path. Start Goal 2 8 3 1 2. 3 1 64 8 4 7 IN 5 7 6 ul 5