the fibonacci series we will use the fibonacci series to illustrate both memoization and tabulation techniques of generating the series the memoization technique let' generate the fibonacci series to the fifth term recursive style of program to generate the sequence is as followsdef fib( )if < return elsereturn fib( - fib( - the code is very simple but little tricky to read because of the recursive calls being made that end up solving the problem when the base case is metthe fib(function returns if is equal to or less than the base case is met if the base case is not metwe will call the fib(function again and this time supply the first call with - and the second with - return fib( - fib( - the layout of the strategy to solve the ith term in the fibonacci sequence is as follows