Problem 8 (10 points). For each of the following methods, determine its big-O characterization in terms of n. A. public static int exampleA (int [ ] arr) { 2 int narr.length, total = 0; Ca public static int exampleC (int[ ] arr) { 3 for (int j=0; j < n; j += 2) 4 5 total arr[j]; return total; 6 } 2 int narr.length, total = 0; 3 for (int j=0; j < n; j++) 4 for (int k=0; k