slove in mathematical

(2) Consider the following 55 area where each cell is indicated in the form [i,j] : Fig-A: 55 Area Fig-B: Cost Matrix Using Dynamic Programming Paradigm, calculate how many possible ways are there to reach the Top Left Cell starting from the Bottom Right Cell in the area given in Fig-A. The Moving constraints are as follows: From any cell you can move towards/go to the cells situated - straight to its left - straight to its upwards - diagonally to its left (both upwards and downwards)