Show that for any natural number n, there is a regular language that is not recognized by any DFA with at most n final states
$\{\lambda, a, a^2, \dots, a^n\}$. All states in which these words are accepted must be different, in order to avoid loops (and stay finite).