Q points $-5$ points per item$).$ For each of the following languages, determine whether they

are regular or non$-$regular.

If you claim the language is regular, please provide evidence for that statement, i$.$e$.,$ a description

of a DFA or an NFA or a regular expression recognizing the language $($there$\text{'}$s no need to formally

prove that the DFA$/$NFA$/$regex recognizes the language, just to give a brief description of it$).$

If you claim the language is non$-$regular, please provide proof using either the pumping lemma,

the Myhill$-$Nerode theorem, or closure properties.

$($a$)|)$:$\}$ either $i$ is odd or $\{$:$ij\}$

$($b$)L_{\text{N}\text{E}\text{Q}}=\{a^i{b}^j|ij\}$

$($c$)|)$:$\}$ is even