A $\textbf{CFG G}$ satisfies the following properties:
- The number of non-terminals (variables) in $G$ is $3$.
- The maximum number of symbols in the right hand side of any production rule is $2$.
- There is a word $w \in L(G)$ whose length is $20$.
Which of the following $\textbf{MUST}$ be true about $L(G)$:
- $L(G)$ is regular.
- $L(G)$ is infinite.
- $L(G)$ can be accepted by a deterministic Turing machine.
- $L(G)$ can be accepted (by empty-stack acceptance condition) by a Nondeterministic pushdown automaton which has only one state.
