What is the time complexity of the below algorithm: def myfunction(n): if n < 2: out = 1 else: out = myfunction(n-1) myfunction(n-2) return out
a) O(2^n)
b) O(n)
c) O(n²)
d) O(log n)