continuation

WANT CODE URGENTLY

3. Slither and Gather A snake moves over a board of size Nx10 and starts swallowing the cells on the board one by one. Some of the cells are poisonous and when the snake swallows a poisonous cell, it dies. After swallowing a non-poisonous cell, the snake's length increases by the value of the cell and then the snake moves to the cell either on the right or the bottom of the current cell. Write a program snake. cpp to find the maximum possible length of the snake for a given board of size Nx10. The program should read N as input, followed by N*10 integers to represent the value of the cells in the board Assume that the cells with value o are poisonous and cells with non-zero integer values are non-poisonous. The snake always starts swallowing from the leftmost cell in the topmost row. Note that once the snake visits a cell, it cannot revisit the cell. Hint: This snake believes in recursion. Input format: The first line contains the number N. The next N lines, each containing 10 numbers, represent the values of the board of size Nx10. You can assume that: N