please answer all questions

Test 2 (COMP3560)-Automata and Formal Languages Solving the following problems. Please write your answers in readable and clean form. (1) Describe the equivalence relation between () regular language and nfa, (ii) regular language and regular expression, and (ii) regular language and regular grammar, respectively +I5 (2) (a) Let r, r, and r, be expression. Find all the regular ones from the following expressions: t8 (b) Given a regular gspregion r = b.aa * +(ba) + b., = b . (d" +a)a*, find L(, ) and L(rs), the languages defined by ri and , respective ly. CL 55 b 5u (c) Find a regular expression r such that L(r) is the same language as L = (b"aba", (an'". aa : n, m 21, h 2 0} (a) Give a regular expressionr ((ab*+b) ab), find an nfa to accept the rebular language Lur) (b) Find the regular grammer which generates L(t)