This question is about $$search$.$ There are three rooms and two robots, A and B$.$

Each room allows at most one robot at a time. We use $$O$$ to represent an empty room.

As a result, there are the following six states. It$$s a centralized system, and the operator

can move one robot $($A or B$)$ to the empty room at a time, resulting in two actions of

MovA and MovB respectively. The operator also has a $$switch$$ action to exchange the

positions of the two robots.

The costs of the MovA, MovB, and Switch actions are $2,3,$ and $6$ respectively. In case of

a tie, actions are selected alphabetically $($MovA is evaluated first, and Switch is the last

evaluated$).$ As an example, the operator can use the action sequence Switch$-$MovB to

go from S$1$ to S$5.$

a$.$ The start state is S$1,$ and the goal state is S$3.$ Using depth$-$first search $($DFS$),$

write down the computed action sequence for the operator. Hint: You might find a

tree helpful in answering this question $($and following two$).$

b$.$ The start state is S$1,$ and the goal state is S$5.$ Using breadth$-$first search $($BFS$),$

write down the computed action sequence for the operator.

c$51$

$94$

S$2$

$35$

S$3$

S$6.$ The start state is S$1,$ and the goal state is S$5.$ Using uniform$-$cost search $($UCS$),$

write down the computed action sequence for the operator.