Give the worst-case Big O running time of this function and explain in detail how you arrived at this answer. public static int f1(int [] a) { int maxSum = 0, this Sum = 0; for(int j = 0; j maxSum ) maxSum this Sum; = else if (this Sum < 0) thisSum = 0; } return maxSum; }