Question 2 4 pts What is the Big-O runtime of the following method? Let n = array.length, which is greater than 0. Note: The symbol^ means power. E.g., 2^n = 21 1. public static int f2(int[] array) { 2. int sum = 0; 3. for (int i = array.length - 1; i > 0; i = i/3) 4. sum += array[i]; 5. return sum; 6.} OT(n) = O(n^2) OT(n) = O(log n) OT(n) = O(2n) OT(n) = O(n) OT(n) = O(n log n)