How an I prove if this language is decidable or not
Consider two cases:


$L_1$ is finite, and so there is a word of maximal length.
$L_1$ is infinite, and so there are words of arbitrarily large length.


Try to see if you can decide $L_2$ in these two cases.