hi

solve q a & b

(a) Given below are the initial state and goal state of the 4-puzzle problem. Suppose that Manhattan distance is used as its heuristic function. The Marihattan distance is defined as the summation of distances between numbered tiles at the current state and the goal state. (i) What is the heuristic value for initial state? [1 mark] (ii) Draw the search tree using greedy search algorithm. Label the expanded nodes with appropriate costs. Highlight the solution path on the search tree. [4 marks] b) Given below is a graph giving the distances between pairs of cities in kilometre (km). A table containing the straight-line distance heuristic values is also provided. Initial state is at City A. The goal is to arrive at City H. (i) Draw the search tree using A search algorithm. Avoid repeated nodes. Label the cxpanded nodes with appropriate costs. [3 marks] (ii) Based on your answer in Question 2(b)(i), state the solution path and its path cost. [2 marks]