Question 3 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 = 2" 1. public static int f3(int[] array) { 2. int sum = 0; 3. for (int i = array.length - 1; i >= 0; i- -) 4. for (int j = i; j >= 0; i--) 5. sum += array[i] + array[i]; 6. return sum; 7.} T(n) = n(n) OT(n) = O(2an) OT(n) = O(n^2) T(n) = O(log n) T(n) = O(n log n)