= 1. This question is about lexer and parsers, regular expressions and languages, and context-free grammars (CFGs). (a) For each of the following statements about languages (i.e. sets of words), state whether they are true or false. Correct answers are awarded 2 marks; wrong answers are penalised by 1 mark (to a minimum of O marks for this question). Omitted answers do not contribute to the marks. [20 marks] i. If A* = A, then A= {e}. ii. For all A and B, (AB)* = A*B*. iii. For all A, B, C, (AUB)C = (AC) U (BC). iv. For all A, B, C, (AB) UC = (AUC)(BUC). v. L = {a"b" : 0