calculate the complexity of the below recursive code Int f(int
n) { If(n return 1; return f(n/2)+f(n/2); }