Dynamic Programming – Fibonacci (Tabulation)

Problem Statement:

Compute fib(6) using Dynamic Programming (Tabulation).

Recurrence: fib(n) = fib(n-1) + fib(n-2), with fib(0)=0, fib(1)=1