Consider the following method. Describe the asymptotic execution time as a function of n using big-O notation: public int find Middlelndex (int[] numbers) throws Exception { int endIndex = numbers.length - 1; int startIndex = 0; int sumLeft = 0; int sumRight = 0; while (true) { if (sumLeft > sumRight) { sumRight += numbers (endindex--); } else { sumLeft += numbers[startIndex++); } if (startIndex > endIndex) { if (sumLeft == sumRight) { break; } else { throw new Exception ("Please pass proper array"); 3 } return endindex: }