write code in c++

Question 2: Recursion with Backtracking (CLO: 2) 5 points Given a square maze containing positive numbers, find a path from the corner cell (marked as 2 in bold) to the middle cell (marked as 0 in bold). You can move exactly ' n ' steps from any cell in two directions i.e. right and down. where n is value of the cell. For instance, if a cell has a value 2, the number 2 indicates that movement along 2 cells are allowed. These 2 cells can be taken in any combination and in any of the allowable direction. For instance, 1 step right and 1 step down will be allowed; however, 2 cells right and 2 cells down will not be allowed as this will count to 4 steps in total. The movement should not exceed the boundary. Your task is to write a function using recursion with backtracking to find a path from corner cell to middle cell in maze. Sample Input: 5 x 5 maze Where cell (0,0) with value 2 is the source and the destination is (2,2) with value 0