Implement algorithm below in Python. Python code needed not c and c++.

This problem is next part of the problem below.(Check link below for the connected problem and the solution)

https://www.chegg.com/homework-help/questions-and-answers/design-algorithm-implement-python-20-pts-consider-computer-game-2d-map-axes-1-2-n-b-b-1-b--q107036577

Remember the first problem of Homework 4. Consider a computer game with a 2D map with axes A(A1,A2,,An) and B(B1,B2,,Bm). The goal is to start from A1B1, move step by step to arrive at AnBm, and reach the highest possible score. At each coordinate the player arrives, they gain a (positive) number of game points. Additionally, there is a rule that restricts the movements. If the player is at AiBj, their next move should be either AiBj+1 or Ai+1Bj, and no other movement is possible. Example: (a) 15 pts. Design a dynamic programming algorithm to solve this problem. (b) 15 pts. Design a greedy algorithm to solve this problem. (c) 10 pts. Consider the brute-force solution given in the solution file of Homework 4. Compare these three solutions in terms of their correctness and worst-case time complexity