Q7MCQ1 mark, −0.33The set of all recursively enumerable languages is:(A)closed under complementation(B)closed under intersection(C)a subset of the set of all recursive languages(D)an uncountable setSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google