Test 2 (COMP3560) Automata and Formal Languages Solve the following problems. Please write your answers in readable and clean form. (1) Fill the blanks to complete the following sentences that describe the relations between regular expression, regular language, and regular gramma. (i) A language L is regular Meresun there is a regular expression r to (ii) A language L is regular (ii)A language L is regulart it. there is an NFA to it there is a regular grammar G toit. (2) The following questions are related to regular expression and regular language: (i) Let r72, r be regular expressions. Find all the regular ones from the following expressions (ii) Given regular expressions r a'bb' + (ab)'(ba)' and r(a+ b find L(r) and L(r), the languages defined by r and r', respectively. (iii) Given the language L (bmbaan, (ab)", bb: 0 and h 1 }, find the regular n, m expression r such that L(r) L