Answer Happy

Artificial Intelligence, Question 1. Consider the searchproblem below with start state S and goal state G. The transitioncosts are next to the edges, and the heuristic values are next tothe states.
QUESTION 1. (2 + 4 + 4 = 10 marks) Consider the search problem below with start state S and goal state G. The transition costs are next to the edges, and the heuristic values are next to the states. h=6 S 6 1 h=8 A h=6 B h=5 3 2 6 6 D h=4 4 E h=2 20 5 F h=1 2 h=0 i. If we use Uniform-Cost Search, What is the final path for this search? ii. If we use Depth First Search, and it terminates as soon as it reaches the goal state, what is the final path for this DFS search? If a node has multiple successors, then we always expand the successors in increasing alphabetical order. iii. What is the final path for this A* search?