Time complexity comparison of Fibonacci series : Recursion vs Dynamic Programming approach

In this video, we will develop the code to find the nth fibonacci element using recursion approach and dynamic programming approach. We will code this using Python 2.7 and also compare the time complexity of the 2 approaches.