Write a method that returns an "encrypted" version of the integer array 'nums'. Each element of the array is to be encrypted by adding the value of 'offset' plus the array index to each array element. After doing that, the result is to be divided by 'cycle'. The remainder of that operation is the new "encrypted" value for that array element. Return an array containing all of these new "encrypted" values. As preconditions, you may assume that all elements in the array and 'offset' are non-negative. You may assume that 'cycle' is positive. (NO! "positive" and "non-negative" are NOT the same thing! You should know this by now!!!) Look at the test data for examples. NOTE: You are NOT allowed to use maps, functional programming, strings, or array lists. You are NOT allowed to have any nested loops or nested recursion. You are NOT allowed to make a giant array that is way longer than the input parameter arrays. Kyle, you must resist your natural impulses!