Recurrence Relation

Let $g_n$ be the number of good passwords of length $n$, and let $b_n$ be the number of bad passwords. The hint allows finding $g_{n+1}$ through $g_n$ and $b_n$. Also, $g_n+b_n$ is the number of all words of length $n$.