What is the maximum depth for the series of recursive calls that can be made?

As many as it takes to reach the base case
  • 1
  • 2
  • n (where n is a parameter passed to the function)

If it were only one, how could we implement something like Fibonacci function?

It can not be a fixed number, as it depends on the application and the input parameter values.