Consider a robotic agent in a section of an automated warehouse. The agent has a battery state

which may be either low or high. Recharging will fill the battery while taking any action in the

high state will result in the battery being drained. The recharging takes place wirelessly so does

not need the robot to move anywhere. There are two stations that require the agents full

attention at a time namely Receiving and Outgoing. The agent can move between these stations.

Each station either contains a package or does not. Processing the Receiving station moves a

package to the Outgoing station but can only be done if there is space. Processing the Outgoing

station removes the package. The system starts with packages at both stations and robot with a

flat battery.

a$)$ Draw a graph which illustrates the state$-$space for this search problem.

b$)$ Give a formal definition for the remainder of the problem.

c$)$ Illustrate $5$ steps of the search process in this state space using your choice of

algorithm.