Using the Processing Coding language, Create a simple Artificially Intelligent Pacma that Recursively searches for exactly one food in the grid using the Breadth$-$First Search $($BFS$)$ algorithm. The user will decide, with two mouse clicks, where the food and Pacman are placed on the grid. You are then required to animate all the paths searched to visually represent how the paths are being searched by BFS in the grid. Finally, once the algorithm finds the food, animate Pacman so that it follows the path and eventually consumes the food.

This assignment will specify $3$ parts for you to implement.

Part $1$ is a representation of the $1020$ grid where your Pacman character will travel to get the food. Pacman can only travel up$,$ down, left, or right. The application will have a GridBasics class that draws the grid, and holds the food location, the Pacman. There are also a couple of utility classes: Slot and Pixel

Part $2$ is a representation of the BFS search algorithm and its data. The Path a single sequence of Slots. The BFS algorithm will need to create a number of these Paths. The PathsSearched class holds a number of Paths that have been searched, plus methods to draw them. The Grid class extends the GridBasics class and actually implements the BFS algorithm.

Part $3$ is a representation of the Pacman.

We are being very specific about the software structure for this assignment so that we may all be on the same page for future assignments.