Consider the five regular language definitions given below under the alphabet $=\{a,b\}$ :

$($a$)$ Where $aa$ is not a substring.

$($b$)$ Where $aa$ and aaa are not substrings.

$($c$)$ Where $aa$ and aba are not substrings.

$($d$)$ Where $aa$ and abaa are not substrings.

$($e$)$ Where aaa and aab are not substrings.

Separate these five languages into groups that you believe all accept the same language. Build

the five automata that recognize these languages, and use JFLAP to confirm your suspicion

that they are or are not the same language.