Rat in a Maze (Recursion Backtracking)
Given M*N matrix, with some cells as blocked, you have to
a) find path from source to destination
b) count no. of paths from source to destination
c) print all possible paths
Given --> rat can move only forward and down
I am not able to solve part b) ie:- count the number of paths from source to destination
Please implement that in the above ide