Figure 2 shows a search tree where A denotes the node corresponding to the initial state, and E is the goal node. In the figure, h=x denotes the heuristic function value and c=x denotes the actual cost between nodes (i.e., arch cost).

a) Find all heuristic(s) in Figure 2 which are inconsistent

b) Create a search tree using the heuristic values given in Figure 2 to carry out A* search from A to find goal node E (Node expanded/visited does not need to be revisited). The tree must show the complete search process with each nodes f(N) values. Report the order of the nodes being expanded, and the final discovered path from A to E

c) Is the path discovered from the above process optimal or not? Explain why

e) Correct heuristic values in Figure 2, such that the A* using the corrected heuristics can find optimal path from A to E. Solutions must show corrected heuristic values for all nodes

Create a search tree using the heuristic values given in Figure 2 corrected heuristic values to carry out A* search from A to find goal node E (Node expanded/visited does not need to be revisited). The tree must show the complete search process with each nodes f(N) values. Report the order of the nodes being expanded, and the final discovered path from A to E

Please clear hand writing to I can Understand the question.

Figure 2: A search tree and husirtic function values Figure 2: A search tree and husirtic function values