Consider the following method. Describe the asymptotic execution time as a function of n using big-O notation: public int[] removeDuplicatesFromSortedArray (int[] input){ int j = 0; int i = 1; //return if the array length is less than 2 if(input.length