can you help answering these question , provide a step by step solution

Coins of various values arc placed on the cells of an n times m chess board. Let the upper left corner cell be (1, 1) and the lower right cell be (n, m); cell (i, j) has coins valued at C_ij. A robot starts at cell (0, 0 and can move only to the right or down on the board. (a) Give a dynamic programming algorithm expressed recursively without to determine the path the robot should follow to maximize the total value of the coins collected as the robot wanders on the board. Analyze the time required. (b) Give the algorithm iteratively with. Analyze the time required