Solutions to a dynamic programming problem have $($at minimum$)$ three things:

$$ A recurrence relation

$$ A brief description of what your recurrence function represents and what each case represents.

$$ A brief description of the memory element$/$storage and how it$$s filled in$.$

Refer to the image for the problem.