Q. 80 Consider the following statements about the context-free grammar,
G = {S → SS, S → ab, S → ba, S → Ε}
I. G is ambiguous
II. G produces all strings with equal number of a’s and b’s
III. G can be accepted by a deterministic PDA.
Which combination below expresses all the true statements about G?
(A) 1 only
(B) 1 and 3 only
(C) 2 and 3 only
(D) 1, 2 and 3
Answer: (B)
Explanation: 
