Figure 3 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).

Please explain why (or why not) the heuristic function in Figure 3 is (or is not) a consistent heuristic. Wh a. b. en carrying out A* search using the heuristic values, what are the order of the nodes being expanded? Please explain your solutions c. What are the possible problem of using A search using the heuristic values in Figure 3 to search the goal node? What is solution to solve the problem? h 105 h 100 h-90 c-100 Fimi re 3. search tree and hlleirtr finction rallle Please explain why (or why not) the heuristic function in Figure 3 is (or is not) a consistent heuristic. Wh a. b. en carrying out A* search using the heuristic values, what are the order of the nodes being expanded? Please explain your solutions c. What are the possible problem of using A search using the heuristic values in Figure 3 to search the goal node? What is solution to solve the problem? h 105 h 100 h-90 c-100 Fimi re 3. search tree and hlleirtr finction rallle