Which one of the following statements regarding non$-$regular languages is true?

The language $\{\begin{array}{c}bab{a}^n\end{array},$ with $\{$:nin$\{2,3,4,$dots$\},$ninZ$\}$ can be generated by the regular expression baba$*$

There exists an FA that accepts the non$-$regular language $\{\begin{array}{c}b{a}^{n}c\end{array},$ with $\{$:nin$\{1,3,4,$dots$\},$ninZ$\}$

If a finite set of words is added to a non$-$regular language, the result is a non$-$regular language.

$\{a^n{b}^n\}=a^{**}{b}^{**}$