Q$10.$ Consider the following algorithm:

g$1=5$

g$2=5$

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?