Please help with writing a ruccurence I am runnin ito errors with the code Question $2$: Bad sizes

Mr E has noticed something quite strange: Any bean stalk whose length leaves a remainder of $2$ when divided by $7$ dies over night.

He demands you change your algorithm to avoid these 'dead lengths.$\text{'}$ You think it might just be his cat digging around in the pots late at night, but you don't wish to argue.

$2(A)$ Write a recurrence.

Write a recurrence minGoodDrops $(j,n)$ that represents the minimum number of drops of fertilizer necessary to grow a bean stalk from $j$ inches to $n$ inches, avoiding any intermediate stage of length $k$ when $k$ mod $7=2.$

$[13]$:dp $=[$float$(\text{'}$inf$\text{'})]*($n $+1)$for i in range$($j$,$ n $+1)$: for d in range$(1,$ n $-$ i $+1)$: if next$\_$length n and next$\_$length $\%7!=2$:return dp$[$n$][14]$:print$($minGoodDrops$(1,9))$ # should be $2$

print$($minGoodDrops$(1,13))$ # should be $2$

print$($minGoodDrops$(1,19))$ # should be $4$

print$($minGoodDrops$(1,34))$ # should be $5$

print$($minGoodDrops$(1,43))$ # should be $5$

print$($minGoodDrops$(1,55))$ # should be $6$

inf

$1$

$12($B$)$ Memoize the recurrence in $2($A$)$

$[10]$: def minGoodDrops$\_$Memoize$($n$)$: # $j$ is assumed to be $1$

return $100$