Consider a language L over (a, b), that ends with 'baa'. Design a non- deterministic finite automaton which recognizes L. Convert it to DFA. Write the tuple form, transition table, transition diagram. (10 Marks) Q2. Consider the following e-NFA (10 Marks) 90 q1 93 92 a) Compute the e-closure of each state. b) Convert the e-NFA to NFA. Minimize the following DFA. Write the steps for minimization clearly. (10 Marks) 92 0 0,1 0,1 b 95 Q4. Design a Finite Automata from the given Regular Expression [ab+ (b + aa) b* a]. Write the step by step construction. (10 Marks) Q5. Convert the following DFA to a Regular expression using Arden's Theorem. (10 Marks)