(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.

(HW4 --> 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.)

Whenever you are asked to design an algorithm, implement your solution inPython3. Write a driver function to test each of these algorithms. Inputs shouldbe randomly generated (by usingrandomlibrary) or taken from the user (you mayassume that the inputs are proper).

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