For each of the following languages prove it is regular (i.e. give a finite automaton that recognizes or a regular expression that describes it) or nonregular (by contradiction of pumping lemma). For all parts, the alphabet is {a, b}.

10. For each of the following languages prove it is regular (i.e. give a finite automaton that recognizes or a regular expression that describes it) or non- regular (by contradiction of pumping lemma). For all parts, the alphabet is {a, b). (a) (wl no (w) nb (w) (b) f w has an equal number of occurrences of "ab" and "ba" as substringsh (d) fa ba l i j k 3) (e) {a li Challenging