Coin-collecting problem Several coins are placed in cells of an n m board, no more than one coin per cell. A robot, located in the bottom right cell of the board, needs to collect as many of the coins as possible and bring them to the upper left cell. On each step, the robot can move either one cell to the right or one cell down from its current location. When the robot visits a cell with a coin, it always picks up that coin. Design an algorithm to find the maximum number of coins the robot can collectCoin-collecting problem Several coins are placed in cells of an n m board, no more than one coin per cell. A robot, located in the upper left cell of the board, needs to collect as many of the coins as possible and bring them to the bottom right cell. On each step, the robot can move either one cell to the right or one cell down from its current location. When the robot visits a cell with a coin, it always picks up that coin. Design an algorithm to find the maximum number of coins the robot can collect

1. recursive defintion write

2. memoized algo

3. iterative algo with save coordinates