Part A: Maze exploration using recursive function (30%) A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N- 1][N-1). A rat starts from source and has to reach the destination. The rat can move in four directions: left, right, up or down. In the maze matrix, O means the block is a dead end and 1 means the block can be used in the path from source to destination. Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally in maze exploration Suggested Approach: Form a recursive function, which will follow a path and check if the path reaches the destination or not. If the path does not reach the destination then backtrack and try other paths. Algorithm: 1. Create a solution matrix, initially filled with O's. 2. Create a recursive function, which takes initial matrix, output matrix and position of rat (i, j). 3. if the position is out of the matrix or the position is not valid then return. 4. Mark the position output[i][j] as 1 and check if the current position is destination or not. If destination is reached print the output matrix and return. 5. Recursively call for position (i+1, j) and (i, j+1). 6. Unmark position (i, j), i.e output[i][j] = 0. Your task is to implement the given algorithm in C++ with recursive functions. You need to test the solution in a main function by creating a 2D array and print out the maze solution correspondingly if there is a path existing