Q1. What is a possible state space description for the problem?

Q2. Indicate the size of the state space and a non-trivial admissible heuristic.

Consider the case of controlling a single insect in a maze where certain squares are filled with pesticide, an example of which is shown below (pesticide squares are green). A valid solution navigating the insect toward its goal must not have it spending more than L time steps in the pesticide squares, or else it will die