1. [11 pts] Search: Squirrel Shenanigans A squirrel is moving around on a grid representing the UC Berkeley campus, picking up and dropping off nuts, in order to store nuts in its nest for the upcoming winter. At the start of the problem, each square on the grid contains between 0 and nuts, inclusive. ( is some constant that is fixed for the entire problem.) There cannot be more than nuts on any square at any time. At the start of the problem, the squirrel is carrying 0 nuts. The squirrel can only carry between 0 and nuts, inclusive, at any time. The squirrel has the following actions available, and every action costs 1: Pick up any number of nuts from the current square (as long as the total number of nuts carried does not exceed ). Drop off any number of carried nuts onto the current square (as long as the total number of nuts on the square does not exceed ). When the squirrel is carrying nuts, the squirrel can move 1 to 1 squares in any of the four cardinal directions (up, down, left, right)