1. Mylar the robot has a simple life. His sole purpose is to avigate from the top row of an NxN grid to the bottom row, while consuming as little fuel as possible. Mylar is able to chos starting column. At each time step he can select from one of three possible actions: move straight down, or move diagonally down left or right If Mylar ever attempts to step off the left or right edge of the grid, he reappears in the appropriate location on the opposite side Complicating Mylar's life is the fact that there may be a different fuel cost associated with traversing each cell in the grid. Here is an example grid along with the optimal sequence decisions (with a total fuel cost of 5): 2 2 12 2 212 2 2 2 1 22 2 12 2 2 2 2 2 2 2 1 Your goal is to develop a dynamic programming algorithm that mylar can use to solve this problem. You should provide an English language description, clear pseudocode, and a performance analysis. The input to the a gorithm s is the NxN grid of nmbers. The output of e algorithms s ou d e e a tue usage: yo n t need to return he at its