The vacuum environment in the preceding question has been deterministic, consider the following stochastic version: Murphys law: twenty-five percent of the time, the Suck action fails to clean the floor if it is dirty and deposits dirt onto the floor if the floor is clean.

1. Discuss and implement a possible agent program for this stochastic version.

2. Which search algorithm/s discussed in the lectures, if any, would be appropriate for this problem? Should the algorithm use tree search or graph search?

3. A version of many search algorithms is already implemented in the code supplied with this assignment. Implement another version your chosen algorithm/s to compute an optimal sequence of actions for a 3X3 world whose initial state has dirt in the three top squares and the agent in the centre. If your chosen algorithm has an already implemented version, compare the performance of both implementations.

4. How is your agent program affected if the dirt sensor gives the wrong answer 10% of the time?