Prove that the following problems are decidable:

$1$

$($a$)(10$pt$)$ Given a regular language L over $\{$a$,$ b$\},$ is it true that L contains infinitely many strings

that have at least one a but finitely many strings that have at most one b$?$