Problem 2 Consider the following three regular languages: La= {w E{ab}*/ w contains an odd number of a's } Lk={w E{ab}* w contains an even number of b's } Lab= {w E{a,b}'l w contains the string ab as a substring} (a) (12 pts) Show that the languages La, Lk, and Lab are regular by giving regular expressions or NFAs for each. (b) (8 pts) Show that the complement based language Ln = Lab is regular by exhibiting either a finite state automaton or a regular expression for Ln. C) (10 pts) Show that the intersection based language Li= Lan Lan Lab is regular by exhibiting either a finite state automaton or regular expression for Li