Given the following two statements:
S1: If L1 and L2 are recursively enumerable languages over ∑, then L1⋃L2 and
L1⋂L2 are also recursively enumerable.
S2: The set of recursively enumerable languages is countable.
Which of the following is correct?
(A) S1 is correct and S2 is not correct
(B) S1 is not correct and S2 is correct
(C) Both S1 and S2 are not correct
(D) Both S1 and S2 are correct
S1: If L1 and L2 are recursively enumerable languages over ∑, then L1⋃L2 and
L1⋂L2 are also recursively enumerable.
S2: The set of recursively enumerable languages is countable.
Which of the following is correct?
(A) S1 is correct and S2 is not correct
(B) S1 is not correct and S2 is correct
(C) Both S1 and S2 are not correct
(D) Both S1 and S2 are correct