Please do in Python.

2. Formulate a grid maze problem. An agent has an initial position in a grid and it needs to move to a goal position in the grid. The grid has some positions that cannot be traversed by the agent (they are static obstacles such as walls). The non-traversable cells are colored dark grey. The initial position is (0,0), the goal position is (5,5), and both of these cells are colored red. The agent can only move 1 location at a time. It can move in 8 directions: up, down, left, right, and in all diagonal directions. 5 4 3 2 1 0 Y x 0 1 2 3 4 5