[2 pts] What is the worst case time complexity for the algorithm f(n) below? State your answer as the best Big-Oh expression (simplified and asymptotically tight)

. long f(int n){

if(n <= 0) return 1;

else

{ return 4 * f(n - 1); } }