Consider the following statements about the context-free grammar: G = {S → SS,…

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 combinations below expresses all the true statements about G?