Solution
= Solution
If an automaton with at most $100$ states accepted a word $w\in L$ of length $100$, the preceding loop argument would produce $xy^iz\in L$ for every $i\geq0$, with $y\ne\varepsilon$. These words have unbounded lengths and are distinct, contradicting the finiteness of $L$.