Which statement regarding a grammar is NOT true: (a) Agrammar is a system of rules to specify which combinations of an alphabet are valid (b) The syntax rules of a grammar can be represented by a finite state machine (FSM) (c) In a context-free grammar, the productions have only a single non-terminal on the left side (d) If a grammar is context-sensitive, there may be some valid strings which cannot be recognized (e) A context-sensitive grammar has more than a single non-terminal on the left side 4. 5. Which statement regarding a finite state machine (FSM) is NOT true: (a) In a non-deterministic FSM, a string is invalid if there is one path not leading to a final state (b) In a simple deterministic FSM, a string is invalid if there is no rule and you are not in a final state (c) In a simple deterministic FSM, not all possible transformations are specified (d) In a simple deterministic FSM, if you are in a final state and there is no rule, the string is valid (e) In a non-deterministic FSM, a string is valid if there is any path which leads to a final state