Translate algorithm to C++ language.

ALGORITHM RobotCoinCollection(C[1..n, 1..m) //Applies dynamic programming to compute the largest number of //coins a robot can collect on an x m board by starting at (1, 1) /and moving right and down from upper left to down right corner //Input: Matrix C[1..n, 1..m] whose elements are equal to 1 and 0 /for cells with and without a coin, respectively //Output: Largest number of coins the robot can bring to cell (n, m) fori2 to n do for i