Match the following statements with True (T) / False (F) :
$S1: \ CFG = \{ <G> \mid \text{ G is a CFG and } L (G) = \Sigma ^* \} \text{ is undecidable}$
$S2: \ A = \{ <G> \mid \text{ G is a CFG over } \{0, 1\} ^*, 1 ^* \cap L( G) \neq \not{0} \} \text{ is undecidable}$
$S3: \ CFG = \{ <G,G'> \mid \text{ G,G' are CFG' s and } L (G) = L (G')\} \text{ is undecidable}$
$S4: \ CFG= \{ ( <G> \mid \text{ G is a CFG and } L (G) = \not{0} \} \text{ is decidable}$
- S1 - T, S2 - T, S3 - T , S4 - T
- S1 - T, S2 - F, S3 - T , S4 - T
- S2 - T, S3 - F, S1 - T , S4 - T
- S1 - T, S2 - F, S3 - T , S4 - F