Compute the shortest path in a maze through backtracking

Question

I need to find the shortest path in a maze of 0\'s and 1\'s of m x n (where 1 is a wall and 0 is an empty space) from [0][0] to [m-1][n-1]