Let $L=\{0,1\}$ and $M=\{1,10,011\}$ be languages over the alphabet $=\{0,1\}.$

Compute the following languages.

$($a$)LM$

$($b$)LM$

Let $L=\{a,ba\}$ be a language over $=\{a,b\}.$ TRUE or FALSE $($with explanation$)$:

$ababin{L}^{**}.$

Let $=\{0,1\}.$ Compute the language of the regular expression.

$($a$)L(01+10)$

$($b$)L(0(11{)}^{*})$