Consider the following statements S1 and S2: S1: If L is recursive and L is recursively enumerable, then L is recursively enumerable. S2: The set of all Turing Machines is countable. Which of the below is true? a) S1 is correct and S2 is not correct. b) S1 is correct and S2 is not correct. c) Both S1 and S2 are correct. d) Neither S1 nor S2 are correct.

Recursive Functions | Meaning & Examples

What is Recursive Algorithm? Types and Methods | Simplilearn