Algorithm Analysis

R-4.9 Give a big-Oh characterization, in terms of n, of the running time of the example 1 method shown in Code Fragment 4.12 and State what value from the example represents input size. Can you be more precise? (Say Big Theta?) R-4.10 Give a big-Oh characterization, in terms of n, of the running time of the example 2 method shown in Code Fragment 4.12 and State what value from the example represents input size. Can you be more precise? (Say Big Theta?) R-4.11 Give a big-Oh characterization, in terms of n, of the running time of the example 3 method shown in Code Fragment 4.12 and State what value from the example represents "input size. Can you be more precise? (Say Big Theta?) R-4.12 Give a big-Oh characterization, in terms of n, of the running time of the example 4 method shown in Code Fragment 4.12 and State what value from the example represents "input size. Can you be more precise? (Say Big Theta?) R-4.13 Give a big-Oh characterization, in terms of n, of the running time of the example 5 method shown in Code Fragment 4.12 and State what value from the example represents input size. Can you be more precise? (Say Big Theta?) 4.5. Exercises 1 ** Returns the sum of the integers in given array. */ public static int example1(int[arr) { int n = arr.length, total = 0; 4 for (int j=0; j