Q35MCQ2 marks, −0.67Let ⟨M⟩\langle M \rangle⟨M⟩ be the encoding of a Turing machine as a string over Σ={0,1}\Sigma=\left\{0,1\right\}Σ={0,1}. Let L={⟨M⟩∣M is a Turing machine that accepts a string of length 2014}.L=\left\{\langle M \rangle \mid M \text{ is a Turing machine}\\\text{ that accepts a string of length 2014} \right\}.L={⟨M⟩∣M is a Turing machine that accepts a string of length 2014}. Then LLL is:(A)decidable and recursively enumerable(B)undecidable but recursively enumerable(C)undecidable and not recursively enumerable(D)decidable but not recursively enumerableSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google