Coin-collecting problem Several coinsare placed in cells of an n× m board, no more thanone coin per cell. A robot, located in the bottomright cell of the board, needs to collect as many of thecoins as possible and bring them to the upper left cell. On eachstep, the robot can move either one cell to the right or one celldown from its current location. When the robot visits a cell with acoin, it always picks up that coin. Design an algorithm to find themaximum number of coins the robot cancollect•Coin-collecting problem Severalcoins are placed in cells of an n× m
PayPal Gateway not configured
PayPal Gateway not configured