it is training day for pacbabies, also known as hungry running maze games day. each of ???? pacbabies starts in its own assigned start location ???????? in a large maze of size ???? × ???? and must return to its own pacdad who is waiting patiently but proudly at ???????? along the way, the pacbabies must, between them, eat all the dots in the maze. at each step, all ???? pacbabies move one unit to any open adjacent square. the only legal actions are up, down, left, or right. it is illegal for a pacbaby to wait in a square, attempt to move into a wall, or attempt to occupy the same square as another pacbaby. to set a record, the pacbabies must find an optimal collective solution. 1.1) (5 pts) define a minimal state space representation for this problem