Q62,p3,j15. Given the following statements.

S1.: If L1 and L2 are recursively enumerable language over ∑,then L1U L2 and L1^ L2 are also recursively enumerable.
S2: The set of recursively enumerable language is countable.
Which of the following is correct

Options
A) S1 is correct and S2 is not correct.
B)S1 is not correct and S2 is correct.
C)Both are not correct.
D)Both S1 and S2 are correct.

Answer D.