What is the time complexity of the following recursive function? void f(int n){ if (n> 1){ System.out.println(" Still going on..."); f (n/ 2); f (n/ 2); Write your answer in O(.) notation. (log(n)) What is the time complexity of the following recursive function? int magic(int N){ sum = 0; for (i=0; i < N; i++) sum++; return magic(N-1) + sum;