Artificial Intelligence Class

Consider the following search problem for questions 2 and 3. The starting state is A and the goal state is D. When we apply search algorithm, we will leave the repeated states. Include the repeated states when you count the number of generated states. The heuristic h value for each state is given as below. 2. (1 point) Apply Greedy-Best Search to find a solution. (2-1) You need to show the process of each action step by step. You need to construct the search tree for each selection with f(n) value. (2-2) What is the solution (the sequence of states to reach the goal)? (23) What is the cost of the solution? 3. (3 points) Apply A algorithm to find a solution. (3-1) You need to show the process of each action step by step. You need to construct the search tree for each selection with f(n) value. (3-2) How many states are generated (including repeated states)? (3-3) What is the order of evaluated (visited) states to find an optimal solution in this search? (3-4) What is the solution (the sequence of states to reach the goal)? (3-5) What is the cost of the solution