$(4-$b$)$ Consider a vacuum word $($as discussed in the class$)$ and the states as shown below

The available actions suck and left behaves as intended. When the agent is in the left tile, initiating the action right

might leave the agent in the same state, instead taking it to the right tile. This is a non$-$deterministic action. The

environment is fully observable. The goal is to get both tile clean, i$.$e states $7$ and $8.$ Show the search tree and a possible

solution to the search tree.$[$You need not apply any search algorithm to show the solution.$]$