A robot has to deliver three identical packages to locations A, B, and C in an office environment. The robot starts in location S holding the packages. The environment is a grid of squares, some of which are free (so the robot can move into them) and some of which are occupied (by walls, doors, etc.). The robot can move in the horizontal or vertical direction into neighboring squares, one square at a time, and can pick up and drop packages if they are in the same square as the robot. Specify the state space representation of the problem by specifying the states, the initial state, the goal test, the actions, and the cost of the actions.