Since there is a * waiting outside, putting n = 1 gives the string $a^1$ which is $a$. Now use your friend *, the one who is waiting for you outside. So it will generate every string over the unary alphabet as the language generated will be $a^*$. So the machine accepting $a^*$ needs only 1 state.