2.10. Suppose L is a language generated by a regular grammar, and consider the following statements: (i) L is a regular language. (i) L is a context-free language. (iii) There is a Turing machine that accepts L Which of the following is correct? (a) Only statementi) isre (b) Only statement (ii) is true (c) Only statement (ii is true. (d) Only statements (i) (e) Only statements (i) and (iii) are true (f) Only statements andi) are true. (g) All 3 statements are true. (h) None of the 3 statements is true nd) are true