Problem #5 [20 points] Consider the simple vacuum problem in Figure 2.2 Figure 2.2 A vacuum-cleaner world with just two locations. . Which of the algorithms that we have covered in class would be appropriate for this problem? b. Draw the state space (all possible states the vacuum cleaner can have) and how they interact Should the algorithm use tree or graph search? [3 pts] (how to get from one state to the next via a vacuum action)? Recall the vacuum can perform three actions, move right, move left, and suck. What is the optimal path assuming the initial state is both A and B have dirt (as depicted in the figure above) and the goal state is both A and B are clean? What is the worst path? [10 pts] Now, apply your chosen algorithm from part a to compute an optimal sequence of actions for a 3x3 world whose initial state has dirt in the top three squares and the agent is at the center. Now the vacuum can move up, down, left, right, and suck) [5 pts] Compare your vacuum search agent with a simple randomized reflex agent that sucks if there is dirt and otherwise moves randomly. [2pts c. d. Problem #5 [20 points] Consider the simple vacuum problem in Figure 2.2 Figure 2.2 A vacuum-cleaner world with just two locations. . Which of the algorithms that we have covered in class would be appropriate for this problem? b. Draw the state space (all possible states the vacuum cleaner can have) and how they interact Should the algorithm use tree or graph search? [3 pts] (how to get from one state to the next via a vacuum action)? Recall the vacuum can perform three actions, move right, move left, and suck. What is the optimal path assuming the initial state is both A and B have dirt (as depicted in the figure above) and the goal state is both A and B are clean? What is the worst path? [10 pts] Now, apply your chosen algorithm from part a to compute an optimal sequence of actions for a 3x3 world whose initial state has dirt in the top three squares and the agent is at the center. Now the vacuum can move up, down, left, right, and suck) [5 pts] Compare your vacuum search agent with a simple randomized reflex agent that sucks if there is dirt and otherwise moves randomly. [2pts c. d