Write a dynamic program with memoization to compute Fn where

Fn $=$ Fn$2+2$ Fn$3$ for n $>=4$ and F$1=$ F$2=2$ and F$3=100.$ Compute the asymptotic running time of the dynamic programming

solution you provided.