Asap Please

Given the recursive function int f( int n){ if (n>) return f(n1)n; else return 1; How many times the function f is called when executing the following code? f(5);//countthisfunctioncallinthetotalcount 6 4 7 8 3 5