Consider the calculation of Fibonacci numbers: $F(n)=F(n-2)+F(n-1)$ with seed values $F(0)=0,F(1)=1($a$)[3]$ Write down a recursive pseudo$-$Algorithm to calculate the Fibonacci and state its time complecity$-$

Time Complexity: Exponential

$($b$)[7]$ Write down a Tope Down and the Bottom$-$Up Dynamic Programming for computing the Fibonacci. State the time complexity.

$\backslash$table$[[$Top$-$down,Bottom up$],[,],[,],[$Time complexity:,$]]$

$\frac{1}{7}$