Consider the following context-free grammar :
In the above grammar, is the start symbol, and are terminal symbols, and and are non-terminal symbols.
Let be the language generated by the grammar . For a string , let be the number of a's in and be the number of b's in .
Which of the following statements is/are true?
- AThere is a string such that
- BFor every string ,
- CThere is a string such that
- DFor every string ,

