Q. Consider the following statements about the context free grammarG = {S - >SS, S - >ab, S - >ba, S - ε}I. G is ambiguousII. G produces all strings with equal number of a’s and b’sIII. 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
• (C) 2 and 3
• (D) 1,2 and 3