c

COP 3502 3 De termine the Big O running time of the following code fragment with explanation of calculation. Consider both the function as a single piece of code. int func2 (in(#. array, int n) { array, int n) o, j = func2 (array, n void func1 (int int i = 0, j-0; while (n>o) int k j-0; n n/2; = return