In the domain depicted above, Pac$-$Man must move one space up$,$ down, left, or right from each state, depending on which actions are allowed

by the surrounding walls. There are two pills in the maze. Pac$-$Man's goal is to eat both pills by moving into the space that contains each pill.

Once a pill is eaten, it disappears from the state. The two pills can be eaten in any order, but the goal is considered reached as soon as both pills

are eaten. Pac$-$Man cannot move around in the maze after both pills are eaten. For any state in which there are no pills, assume that any heuristic

function used below returns a value of $0,$ and is thus defined for all possible states.

What is the size of this state space? $($number of states$)$

Answer:

Explain your answer to the previous question, demonstrating how you calculated it$.$ Show the exact numbers and calculations used in addition to

explaining what each number represents.