Using A* algorithm, find the shortest path from A to F. Assume the heuristic (straight-line distance to F) is: h(A)=5, h(B)=4, h(C)=2, h(D)=6, h(E)=3, h(F)=0 Show your step-by-step calculation, including f(n)=g(n)+h(n).

What is Greedy Best First Search? Explain with an example the different stages of Greedy Best First search.

Consider the graph shown below where the numbers on the links are link costs and the numbers next to the states are heuristic estimates. Note that the arcs are undirected. Let A be the start state and G be the goal state. Simulate A* search with a strict expanded list on this graph. At each step, show the path to the state of the node that's being expanded, the length of that path, the total estimated cost of the path (actual + heuristic), and the current value of the expanded list (as a list of states).

Is the heuristic given in Problem 5.a consistent? Explain.