Explain in details, please Select the running time of the following recursive function f(n) : int f( int n){ if (n==0) return 2; if (n%2==1) return 2f(n1); int val =f(n/2); return val val; \} Select one option from the list (logn)(n)(nlogn)(n)(1).

1. Explain in details, please Select the running time of the following recursive function f(n) : int f(
int n){ if (n==0) return 2; if (n%2==1) return 2f(n1); int val =f(n/2); return val val; } Select one
option from the list (logn)(n)(nlogn)(n)(1)