Problem 5. Write a corresponding CFG for the following languages where I = {a,b). a) L = {a^wbN: we {a,b)", N 2 0} b) L = {wb: w {a,b)" c) L = {all strings in {a,b)* where the number of a's is odd) Problem 6. Convert the following Finite Automata to Regular Grammar