Question 5 Which of the following statements about non-regular languages are true? Statement A: A non-regular language cannot be accepted by a finite automaton (FA). Statement B: A non-regular language can be accepted by a transition graph (TG). Statement C: All languages are either regular or non-regular - none are both. 1. 2. 3. 4. Only statements A and B are true. Only statements A and C are true. Only statements B and C are true. Statements A, B, and C are all true