Design algorithm and implement in Python.

20 pts. 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: Input: n=4,m=3 Game map: Output: Route: A1B1A2B1A2B2A3B2A3B3A4B3 Points: 25+45+15+88+15+23=211 Design a brute-force algorithm to find the sequence of steps to reach the maximum number of