implement a program in java which will solve snapshots of a maze game. We have a given starting position and a final destination for a robot, We have a boolean 2D array MxN and if a cell is False it means that there is an obstacle that robot must avoid. We have to implement two algorithms , 1) find the shortest path from the starting point to the ending point , 2) find another path different from the previews one. The robot can move up,down,left or right.

The solution must be in the form (111111) using linkedlist or stack The complexity of the algorithm must be O(N).