Maze

Write a program to find all the possible paths from a starting point to dest point in a maze(2-D array).

ex: 1 0 1 0
 1 1 1 1
 0 1 0 1
 0 0 1 1 

If there is a block it’s represented by 0.
If there is a path it’s represented by 1.