Question 1: Explain dynamic programming with the help of example. Question 2: You are the chief commander of US Army; you have been deployed in an ongoing war training of defusing the mine. Mines are...

Required the solution for quesstion 2 only.

Extracted text: Question 1: Explain dynamic programming with the help of example. Question 2: You are the chief commander of US Army; you have been deployed in an ongoing war training of defusing the mine. Mines are placed on the ground which can be considered as a gird of size N*M. Each block (i, j) has a mine in it if and only if thesummation of the block coordinatesis divisible by 2.Your task is to move from the first row to the last row. The mines will not blow if the given rules are followed: If you are on even row you can move to any cell that is in the neighborhood If you are on odd row, you can only go the odd row that has mine on that and same with the unmined row. You have to develop a python program to calculate the number of ways to reach row number N starting from row number 1. Test Cases: 48 Output: 10 Question 3: What do you understand by the time complexity of an algorithm. Find out the Algorithm No. 5 that we studied in the class.