Consider the five regular language definitions given below under the alphabet

$\backslash$Sigma

$=$

$\{$

a

$\}$

$$:

$($

a

$)$

$\{$

a

l

$|$

l

$-$

$=$

$0$

$,$

$($

m

o

d

$6$

$)$

$,$

l

$$

$0$

$($

m

o

d

$4$

$)$

$\}$

$$

Build the five automata that recognize these languages, and use JFLAP to confirm or draw it PLEASEConsider the five regular language definitions given below under the alphabet $=\{a\}$ :

$($a$)\{a^l|l-=0,(mod6),l0(mod4)\}$