Question number2 please

Due 5 October 2017 1. Construct an NFA that will accept the language L = L(ab*a*)U L((ab)"ba). 2. Find a minimal DFA that accepts the language L- L(abb)*) L(a bb*). 3. Find a regular expression for the language accepted by: a. generated by the grammar: A baB S. Construct a right-linear grammar for Li(aab'ab)") 6. Construct a left-linear grammar for the language of Problem 5