Consider the language a$*$b $+$ baa$($b$*+$a$).$ Mark the correct statements below. Incorrect marks will reduce your grade.

Any string in this language contains at least one $"$b$".$

The shortest string that contains at least one $"$a$"$ in this language is baa. b $\backslash ($

otin $\backslash$mathrm$\{$L$\}(\backslash$mathrm$\{$M$\})\backslash )$

The start state of the FSM that recognizes this language is not an accepting state.

This is not a regular language.

The shortest string in this language is $\backslash (\backslash$Lambda $\backslash ).$