If a problem can be shown that it belongs to the class of recursively enumerable languages then ______________________.

• It may be solved by any TM Correct
• It may be solved by a special RE
• It may be solved by a special TM
• It may be solved by any RE