Algorithm and Analysis Question

Robot Coin Collection

• Robot is in position 0, 0 (top left corner)
• The goal is in position N, M (bottom right corner)
• The robot can only move to the right 1 square or down 1 square
• Create code in C or C ++ that can: - Count the most coins that can be collected! - Determine the route of the Robot in collecting the most coins!

Robot and coins starting position

Solution

P.S:

- Please answer in a proper format - Please answer in a typed format - Please don't do it with pen or pencil, do it with software or tools - If you want to ask any question, ask it in the comment section, I will try to answer it

Thanks!

R C 0 1 2 3 1 1 3 3 3 3 1 1 4 4 5 1 2 4 4 6 1 1 N 4 5 5 6