For language $($aaa$)*,$ 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 $1$ options:

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

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

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

ab$,\backslash$epsi ; ba aba

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

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

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

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