Statement I: Li be regular language i = 1, 2, . . ., ∞
Language ⋂ ∞=1is regular i.e. Infinite intersection.
Statement II: L = {wx | w ∈ Ʃ*, x ∈ Ʃ*, |w| = |x|} is regular.
(a) Both are True (b) Both are False
(c) S1 → True, S2 → False (d) S1 → False, S2 → True