What is the time complexity of the above recursive implementation to find the nth fibonacci number?

• A. O(1)
• B. O(2*n)
• C. O(n2)
• D. O(2n)