7 2 4 1 2 3 5 6 4 | 5 | 6 Consider the following 8-Puzzle problem: [1] Show its state space search tree. [2] Apply the A* search algorithm to minimize the total cost along a path from start state to goal sate (l. e. show sequences of OPEN and CLOSED lists). 8 II 3 1 7 8 Goal State Start State Where f(n) - h(n) + g(n), f(n) is the estimation of the total cost along path through n, h(n) is the number of rnisplaced tiles, and g(n) is the depth of the tree as the cost from the root to the current node