Consider the following regular expressions and provide two strings that are members and

two that are not members of the regular languages described by those regular expressions. A

total of four strings for each part. Assume the alphabet $\backslash$Sigma $=\{$a$,$b$\}$ in all parts.

a$)$ a$$b$$

e$)\backslash$Sigma $$a$\backslash$Sigma $$b$\backslash$Sigma $$a$\backslash$Sigma $$

b$)$ a$($ba$)$b f$)$ aba $\backslash$cup bab

c$)$ a$\backslash$cup b$$ g$)(\backslash$cup a$)$b