Consider the following 5 x 6 area where each cell is indicated in the form [i, j]: [0, 01 10, 11 [0, 21 [0, 31 [0, 41 [0, 5] [1, 01 [1, 11 [1, 21 [1, 31 1, 41 f1, 5] [2, 0] [2. 1] [2, 2] 12. 3] [2, 4J 12, 5] [3, 0] [3, 1] [3, 21 [3, 3] [3, 4] [3, 5] [4, 0] [4, 11 [4, 21 [4, 31 [4, 41 [4, 51 Starting cell is [0, 5] and journey ends at [4, 0]. The following moves are valid for any REACHING cell [i, j]: If the j value of any REACHING cell [i, j] is ODD, then you can COME TO/REACH that cell FROM the cells situated STRAIGHT to its RIGHT and STRAIGHT to its UPWARDS If the j value of any REACHING cell [i, j] is EVEN, then you can COME TO/REACH that cell FROM the cells situated STRAIGHT to its RIGHT, DIAGONALLY UPWARDS to its RIGHT and STRAIGHT to its UPWARDS Calculate how many ways are there to reach the BOTTOM LEFT CELL from the TOP RIGHT CELL.