QUESTION 4 NOTE. Throughout this question the alphabet is fa b. (a) Let the language L1 be the language generated by the regular expression (ab)". Define L [6 marks] by recursion (b) () Define the languages L2 and L3 as follows Write down the product language L2 L3 is lexicographic order 3 marks] (i) Construct ad hoc a finite automaton which accepts the language L3 in (). [2 marks] 3 marks (d) Construct a Turing Machine (TM) for computing the ones' complement of a binary number (c) Write down a regular expression for the language L2 from part (b). Requirements QUESTION 4 NOTE. Throughout this question the alphabet is fa b. (a) Let the language L1 be the language generated by the regular expression (ab)". Define L [6 marks] by recursion (b) () Define the languages L2 and L3 as follows Write down the product language L2 L3 is lexicographic order 3 marks] (i) Construct ad hoc a finite automaton which accepts the language L3 in (). [2 marks] 3 marks (d) Construct a Turing Machine (TM) for computing the ones' complement of a binary number (c) Write down a regular expression for the language L2 from part (b). Requirements