Please write the code in python .

Lab 05: A Maze Without Walls (part 1) In this puzzle, you are given a grid of numbers, presented as a list of lists. the number in each grid square tells you how many steps you can move in one direction. For example, from a square with a number 2, you can move two squares up, two squares down, two square right, or two squares left The goal, like in a maze is get from a start position to an end position. Represent the Puzzle When dealing with a list of lists, if can get a little confusing about how to access individual elements. If we have [ [1,2], 3, 4] , then L [0] [1] is 2 . The first index is the row, starting from zero. Increasing this index moves down the grid (this is also how matrices are indexed). The second index is the column number, starting at zero. As a result, it makes sense to indicate a position in the grid using a tuple (r, c),where r is the row and c is the column. We will build a puzzle class with the following ADT onboard(position) return True if the (rc)-pair position is within the bounds of the grid. Return False otherwise getitem (position) -return the number stored in the (rc)-pair rdsolve (start, end) position end using only right and down moves. Return False otherwise solve(start, end) return True if it is possible to get from the position start to the position end. Return False otherwise . position -return True if it is possible to get from the position start to the * Start by writing a class called Puzzle and store it in a file called puzzle.py. Write an-init method that takes a list of lists of integers. It should store these lists internally. The initializer should raise ValueError if the lists do not all have the same length (only rectangular puzzles are allowed). Next, implement the onboard method to check if a given row and column (given as a tuple of ints) is within the bounds of the input lists. getitem is great