Question # $02$

Categorize the following languages by determining, whether the given language is regular or not. Justify

your answers. Use the pumping Lemma to prove that some language is not regular.

a$)\{win\{a,b{\}}^{*}||w{|}_a$mod$2=0\}$

b$)\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{a,& b{\}}^{*}|w\end{array}$ starts or ends with a pair of the same symbols