What is the maximum depth of the call stack when f(5) is called? int f(int n) { if(n==0) return 0; return f(n-1)+1; }