Solver uing dynamic programing or greedy algorithm

Problem 3: Suppose you are given an array A[1...n] of positive integer values. An ant begins at position 1 of the array, and makes a sequence of 'moves' to get from the first to the last element. In each 'move', the ant looks at the value of the array where he is standing (i.e., if the ant is at index i, then he looks at value A[i), and can move forward by 0 up to Ai] steps. For example, if the ant is standing at position 4, and A43, the ant can stay at position 4 or go to position 5, 6, or 7. The ant wishes to get from position 1 to position n in as few moves as possible. Describe an algorithm to tell us what sequence of moves should the ant make. Note: this can be solved through either a greedy algorithm or a dynamic Problem 3: Suppose you are given an array A[1...n] of positive integer values. An ant begins at position 1 of the array, and makes a sequence of 'moves' to get from the first to the last element. In each 'move', the ant looks at the value of the array where he is standing (i.e., if the ant is at index i, then he looks at value A[i), and can move forward by 0 up to Ai] steps. For example, if the ant is standing at position 4, and A43, the ant can stay at position 4 or go to position 5, 6, or 7. The ant wishes to get from position 1 to position n in as few moves as possible. Describe an algorithm to tell us what sequence of moves should the ant make. Note: this can be solved through either a greedy algorithm or a dynamic