Here is code for a function that takes an array of nonnegative integers nums with length n and returns a value that occurs more than once or returns -1 if no such value exists, it is assumed that n>=1. int getRepeatedValue(int nums[l, int n ) : if (n=n1) return -1 : int r - getRepeatedValue(nums, n1) : if (r!1) return r : for ( int i=0;i 1) the last two values in the array are the same and there are no repeats otherwise. Explain winy the same recurrence as in Part a can be used