Give a big-Oh notation, in terms of n, of the running time of the algorithm shown in the following code fragment: /** Returns the sum of the prefix sums of given array. */ public static int example 3 (int[] arr) { int n = arr.length, total = 0; for (int j = 0; j