Computer Engineering lab In WW2, allies have placed their mines on the ground which can be consideredas a gird of size N*M. Rows are numbered by integers from 1 to N and columnsare numbered by integers from 1 to M. Each cell (i,j) has a mine in it if (i+j) isdivisible by 2. All the other cells are empty.Two cells are neighbours if they share a boundary or a corner. Your aim is tomove from the first row to the last row using some special rules that theautomatic mine placing system follows. The mines won't blow if the followingrules are followed:• If your current row number is odd, from a 'mined' cell (i.e. cell having amine in it) you can move only to a neighbouring 'mined' cells in the nextrow, and similarly, from a 'not mined'(i.e. an empty cell) cell you canonly move to a neighbouring 'not mined' cell in the next row.• If your current row number is even, you can move to any neighbouringcell in the next row, irrespective of the mining.You have to find the number of ways to reach row number N starting from rownumber 1, modulo 10°+7. Two ways are different, if there is at least onedifferent cell on the paths. Find a pythonic approach for the solution anddevelop a optimized python code. Sample inputs outputs are listed below:Input:125Output:8

In WW2, allies have placed their mines on the ground which can be considered as a gird of size N*M. Rows are numbered by integers from 1 to N and columns are numbered by integers from 1 to M. Each cell (i,j) has a mine in it if (itj) is divisible by 2. All the other cells are empty. Two cells are neighbours if they share a boundary or a corner. Your aim is to move from the first row to the last row using some special rules that the automatic mine placing system follows. The mines won't blow if the following rules are followed:

In WW2, allies have placed their mines on the ground which can be considered as a gird of size N*M. Rows are numbered by integers from 1 to N and columns are numbered by integers from 1 to M. Each cell (i,j) has a mine in it if (itj) is divisible by 2. All the other cells are empty. Two cells are neighbours if they share a boundary or a corner. Your aim is to move from the first row to the last row using some special rules that the automatic mine placing system follows. The mines won't blow if the following rules are followed:

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks