1-Develop a recursive definition for the Coin-collecting problem Several coins are placed in cells of an n m board, with no more than one coin per cell. A robot, located in the bottom right(n,m) cell of the board, needs to collect as many of the coins as possible and bring them to the top left(1,1) cell. On each step, the robot can move either one cell to the left or one cell up from its current location. When the robot visits a cell with a coin, it always picks up that coin. when the robot exists from the top-left position(1,1) it must have the maximum number of coins from all the possibilities

2-Develop a space-optimized iterative algorithm for the problem.

Be careful that the robot is going to start from the bottom right(n,m) and going to exist from the upper-left (1,1) position