For language $($a$\backslash$cup ba$\backslash$cup bb$)\backslash$Sigma $*,$ give two strings that are members and two strings that are not members$$a total of four strings for each part. Assume the alphabet $\backslash$Sigma $=\{$a$,$b$\}$ in all parts.

Question $2$ options:

$\backslash$epsi $,$ aaa; aa$,$ b

ba$,$ bba; b$,\backslash$epsi

b$,$ ab; $\backslash$epsi $,$ bb

ab$,\backslash$epsi ; ba aba

$\backslash$epsi $,$ aa; ab$,$ aabb

aba, bab; $\backslash$epsi $,$ ababab

aba, aabbaa; $\backslash$epsi $,$ abbb

ab$,$ abab; $\backslash$epsi $,$ aabb