Consider the following statements about the context-free grammar:
(1) $G = \{S \to SS, S \to ab, S \to ba, S \to \epsilon\}$
(2) $G$ is ambiguous
(3) $G$ produces all strings with equal number of $a$'s and $b$'s

$G$ can be accepted by a deterministic PDA. Which combination below expresses all the true statements about $G$?
(i) 1 only
(ii) 1 and 3
(iii) 2 and 3
(iv) 1, 2 and 3