In Java,

Given an array of positive integers nums you start at the Each element in the array represents the maximum length you can move forward by (e.g. if current element is 3, you can move forward by either 1, 2, or 3). Determine the minimum number of moves you need to exit the array. You may assume that the array will never be empty. Example 1: nums = [1,2,5,2,1,1] Output: 3 Explanation: Move 1: Index 0 -> Index 1 Move 2: Index 1 -> Index 2 Move 3: Index 2 -> Exit Exit Example 2: nums = [4,2,1,5,1,2] Output: 2 Explanation: Move 1: Index 0 -> Index 3 Move 2: Index 3 -> Exit For this test you're using Java Open]DK 12 Feel free to add comments in your code explaining your solution