(Solved): Design algorithm and implement in Python. 20 pts. Consider a computer game with a 2D map wit ...

Design algorithm and implement in Python.

20 pts. Consider a computer game with a 2D map with axes \( A\left(A_{1}, A_{2}, \ldots, A_{n}\right) \) and \( B\left(B_{1}, B_{2}, \ldots, B_{m}\right) \). The goal is to start from \( A_{1} B_{1} \), move step by step to arrive at \( A_{n} B_{m} \), 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 \( A_{i} B_{j} \), their next move should be either \( A_{i} B_{j+1} \) or \( A_{i+1} B_{j} \), and no other movement is possible. Example: Input: \( n=4, m=3 \) Game map: Output: Route: \( \quad A_{1} B_{1} \rightarrow A_{2} B_{1} \rightarrow A_{2} B_{2} \rightarrow A_{3} B_{2} \rightarrow A_{3} B_{3} \rightarrow A_{4} B_{3} \) 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 total points.