Consider the following statements about the context-free grammar:
$$G = \left\{S \rightarrow SS,S \rightarrow ab, S \rightarrow ba, S\rightarrow \wedge \right\}$$
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?

A

I only

B

I and III only

C

II and III only

D

I, II and III