For each of the following languages state whether it is regular or not. If

$$

$$

L

i

$$

is regular, prove it by drawing either a DFA or an NFA that recognizes it$.$

If the language is not regular, give an argument in plain language why there is no DFA or NFA that can recognize it$.$

For each question, assume

$\backslash$Sigma

$=$

$\{$

$$

$,$

$$

$\}$

$\backslash$Sigma $=\{$a$,$b$\}.$L b$=\{$b$^$n ww:w in $\{$a$,$b$\},$n$>=0\}$