in Matrix A with 6 rows and 4 columns. where ‘#’ = blocked path and ‘.’ = allowed path.. How to find the number of steps needed to reach from top left to bottom left.I am able to traverse the matrix from top left to bottom right but unable to find the steps(which is 8 here)..But the code below I