Give a big-Oh characterization, in terms of n. of the running time for each of the following algorithms (use the drop-down): public void func1(int n) { for (int i = n; i > 0; i--) { System.out.println(i); for (int j = 0; j 0) { system.out.println(i); i = i / 2; 0(1). A. O(logn). } B. O(n) C. O(nlogn). D. } public void func3 (int [] A) { int i = A.length; // length is a variable which contains // the number of elements in an array if (L%2 ==0) System.out.println("Even elements"); else System.out.println("Odd elements"); } public void func4 (int n, String msg) { for (int i = n; i > 0; i--) for (int j = 0; j