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

Question $37$ options:

A$)$

O$($n$^2)$

B$)$

O$($n logn$)$

C$)$

O$($log n$)$

D$)$

O$(2^$n$)$

E$)$

O$($n$)$