What is the time complexity of the naive recursive Fibonacci algorithm?
O(n)O(n)O(n)
O(n2)O(n^2)O(n2)
O(2n)O(2^n)O(2n)
O(logn)O(\\log n)O(logn)