There is a language L such that L is not recursive (L is undecidable), yet L and its complement are both recursively enumerable.

• 因为英文水平太差，所以急需援助下面这道英文的题目，不知道能不能给我翻译一下，实在是理解不了： 题目：Consider the following statements: I.