What is the time complexity of the following function?

def fibonacci $(n)$ :

if $n1$ :

return $n$

return fibonacci $(n-1)+$ fibonacci $(n-2)$

Select one:

a$.O(logn)$

b$.O(n^2)$

c$.O(2^n)$

d$.O(n)$