When is the concatenation of a language $L$ with $\Sigma^*$ regular?
In the first case, $n$ can be 0, and the concatenation will produce $\Sigma^*$. So any other value of $n$ is irrelevant; no other strings could be added. If the restriction were $n&gt;1$, then the concatenation would not be regular.