4. Using A*search for the 8-puzzle, search (manually) for a path from to the goal node (a) Using the heuristic h1 which counts the number of squares that are not in the right place. (b) Using heuristic h2 which measures the Manhattan distance (For every square the horizontal and vertical distances to that square's location in the goal state are added together)