need help this question

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 Ai]), and can move forward by 0 up to Afi] steps. For example, if the ant is standing at position 4, and A[4-3, 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 mak Note: this can be solved through either a greedy algorithm or a dynamic programming algorithm! Either answer is acceptable here, but for your own benefit, I suggest that you try to solve it both ways (but only provide one answer in the homework that you submit