only #3 please

3. Use the construction algorithm given in the proof of Kleene's theorem to construct an automa- ton (NFA) for the regular expression ((ab)*b+ ab)* 4. Assume L = { awak k=1+}. a. Show L is context-free by giving a context-free grammar that generates the language. b. Use the CFG from Part a to give a pushdown automaton that recognizes L