The time complexity for the recursive Fibonacci algorithm is $\_\_\_\_\_\_\_\_.$

Question $16$ options:

O$(2^$n$)$

O$($logn$)$

O$($n$^2)$

O$($nlogn$)$