$.$ Consider the following algorithm:

g$1=9$

g$2=2$

For k starting at $3$ and ending with $8$:

gk $=($k$-1)$gk$-1+$ gk$-2$

What is the last term, g$8,$ of the recursive sequence generated as a result of executing this algorithm?