int F[n][m];

F[1][1] = board[1][1];

for (int j = 2; j

F[1][j] = F[1][j-1] + board[1][j];

}

for (int i = 2; i

F[i][1] = F[i-1][1] + board[i][1];

for (int j = 2; j

F[i][j] = max(F[i-1][j], F[i][j-1]) + board[i][j];

}

}

return F[n][m];

5. How would you modify the dynamic programming algorithm for the coin collecting problem if some cells on the board are inaccessible for the robot? Apply your algorithm to the board below, where the inaccessible cells are shown by X's How many optimal paths are there for this board? 1 2 345 6