(Refer: SearchTestFigures, Figure 3, heuristic values f on n…

(Refer: SearchTestFigures, Figure 3, heuristic values f on nodes are shown)  In an A* search, the min-priority queue Q goes through the following sequence over first few iterations. Which one is the correct priority-queue in the next to next step? Step 0: a7 Step 1: b6, c7, d9 Step 2: e5, c7, d9    

(Refer the Figure 4, 8-puzzle) Heuristic h2=Sum of Manhattan…

(Refer the Figure 4, 8-puzzle) Heuristic h2=Sum of Manhattan distances from tiles’ correct positions. What is the h2(d) value of the node d? [Note, Manhattan distance is measured by summing horizontal and vertical distances. Example: h2(s) of the start state s is = 1+1+0+0+1+1+0+2, respective distances for tile #1 through #8]