The time complexity for the Fibonacci algorithm using the dynamic programming approach is $\_\_\_\_\_\_\_\_.$

O$(2^$n$)$

O$($n$)$

O$($logn$)$

O$($n$^2)$