In Big- notation, analyze the running time of the following pieces of code/pseudo-code. Describe the running time as a function of the input size (here, n)

void f3(int* A, int n) { if(n <= 1) return; else { f3(A, n-2); // do something that takes O(1) time f3(A, n-2); } }