Fibonacci Series

#1

Time Complexity and how to calculate it??

#2

Complexity is O(2^n)
You can calculate it using different methods like Recursion tree method or Using Master theorem.
Or simply you can see that each recursive call makes 2 calls
So total calls would become 1+2+4+8+16+…2^(n-1)