Let's now discuss the time and space complexity of the tabulation approach that we have just now discussed.
The time complexity of this solution is going to be of the order of N, because notice that we are iterating
from two up to five to find f of five.
So we are doing almost n operations.
So that's why the time complexity is O of n.
The space complexity of this solution is also of the order of n, because we have to create this one
dimensional table, which is an array.
So that's why the space complexity is also of the order of n.