Exercises.java: class Exercises { / Returns the sum of the integers in given array. */ public static int example1(int[] arr) { int n = arr.length, total = 0; for (int j=0; j Returns the sum of the integers with even index in given array. / public static int example2(int[] arr) { int n = arr.length, total = 0; for (int j=0; j / public static int example3(int[] arr) { int n = arr.length, total = 0; for (int j=0; j Returns the sum of the prefix sums of given array. */ public static int example4(int[] arr) { int n = arr.length, prefix = 0, total = 0; for (int j=0; j Returns the number of times second array stores sum of prefix sums from first. */ public static int example5(int[] first, int[] second) { // assume equal-length arrays int n = first.length, count = 0; for (int i=0; i

Exercise 1 a) Give a big-Oh characterization, in terms of n, of the running time of the examplel method from Exercises.java class in Lesson4Examples folder. b) Give a big-Oh characterization, in terms of n, of the running time of the example2 method from Exercises.java class in Lesson4Examples folder. c) Give a big-Oh characterization, in terms of n, of the running time of the example3 method from Exercises.java class in Lesson4Examples folder. d) Give a big-Oh characterization, in terms of n, of the running time of the example4 method from Exercises.java class in Lesson4Examples folder. e) Give a big-Oh characterization, in terms of n, of the running time of the example5 method from Exercises.java class in Lesson4Examples folder. For each of the above questions, use comments in the code to provide the results and a brief explanation