Using appropriate diagrams and code snippets, show how the recursive calculation of the Fibonacci sequence f(n) with f(0) = 0; f(1) = 1; f(n) = f(n-1) + f(n-2) can be greatly improved when the dynamic programming approach is applied.