Problem $1).$

a$).$ List all strings in L$(($aab$+$bb$)^(*)$b$($a$+$ab$)^(*))$ of length five.

b$).$ For the given Regular expression R$=$a$($ba$)^(*)$b$($aa$+$b$),$ provide $2$ strings that are from and $2$ strings that are not from

the language of R$,$ that have length $>=5$

c$).$ For the given Regular expression R$=(\backslash$lambda $+$b$)$a$($b$+\backslash$lambda $),$ provide $2$ strings that are from and $2$ strings that are not from

the language of R

d$).$ Describe in English the language of the following regular expression $($a$+$b$)^(*)+$c$^(*)$

e$).$ Describe in English the language of the following regular expression $0(111)^(*)0$

f$).$ Provide a regular expression describing the following language L$=\{($ba$^($n$)$w$)$:$\},$ where w in$($mini epsilon$)\{$a$,$b$\}^(+)$and n$>2\}$

g$).$ Provide a regular expression for the language L that is comprised of all strings from $\{$a$,$b$\}^(*)$ that contains at most $1$

a and least $2$ b$\text{'}$s$.$

h$).$ Provide a regular expression for the language of all strings from $\{$a$,$b$\}^(*),$ where the number of times character b appears in any string is a multiple of $3.$

I$).$ Provide a regular expression for the language

L$=\{($w$|$win$($litte epsilon$)\{$a$,$b$\}^(*))$:$\}$ and w is not ab$\}$