I need help creating a jeroo smart enough to navigate a simple maze, picking all of the flowers and disabling all of the nets.

The starting position for your jeroo will always be the southeast corner of the island at (width - 2, height - 2).

After running the maze, the jeroo should always end at the ending position, which is at location (1, 1).

The catch is that Maze Island changes every time. Sometimes it is wider, sometimes narrower--the only constant is that it is rectangular and surrounded by water. Flowers can grow anywhere and everywhere on the island. Also, there may be up to fifteen nets located on the island, although there will never be a net at the starting position.

Further, you I will have to write software tests to demonstrate your jeroo can handle this task. I am lost in the part of creating new classes and things like that., this is a programm called greefoot sofia. If someone could help me with this I would appreciate it a lot. I posted one of the possible mazes, they change everytime I try to compile a code. Also I dont know if there is enough information to help me, so if someone can help me with this that would be good too!