Construct a memo table as a dictionary that maps from $($i$,$j$)$ where $0<=$ i $<=$ n and $-1<=$ j $<$ i to the value $(,,)$ where $=[]$ if $>=0$ else $=$None $.$

Your code should run in worst case time $\backslash$Theta $(2).$