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 funci(int n) for (int i = n 1 > 0; 1-4) System.out.println(i): for (int j = 0; j 0: 1--) o(n) F 0(1). A. O(logn). B. On) C. O(nlogn). D. - On). E. On) F. public void func3(int [] A) int L - 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 funct(int n, String mag) for (int i = n; i > 0; i--) for (int j = 0; j