2.7. I L is a language accepted by some Turing machine M. then (a) we t'mest be rejected by M. (b) rimming M with we initially loaded on the TAPE will result in Memuling in HALT state (c) must be a rolar lang 3 2.8 Let = (4.0), and it be the language over exactly unisting of all strings that do not contain the string and Consider the following regular expressione (1) (+)*(+4)*(+) (1) (+ ab + b)(A++) (iii) (A++)(++) Which of the following is currect (a) Only regalar proton (1) ales l. (b) Only regular expresion () generates L (c) Only regular expression (i)rerates L (d) Only regular expressions (i) and (ii) gerate (e) Only regular expression () (l) sette (1) Only regular expressions (l) and (ii) enernte (8) All regular expression et L. (1) None of the regular expressione greates L 2.0 L = (0.6), and it l. = (wa"1). Consider the following statements (1) Llum regular expressional + (ii) L. is a non-tegalar langing (iii) Le context.free SIS where S. Xenonterminal (lv) L contextfree s Sax XOXA where SX are interminal Which of the following is true? (a) Only statement (i) is currect. (h) Only statement (ii) is correct (c) Only statement () is correct. (d) Only statement (iv) is correct (e) Only statements) and (iii) are currect. 6) Only statement (i) and iv) are cert () Only statements) and (ii) are correct (1) Ouly statement (1) And (lv) Arco 0) Only statement (u), (i) and (iv) are correct. ) All the statements are correct (k) None of the statement is correct