Which of the following four statements accurately describe what it means for a decision problem X to be recursively enumerable? There exists a sound and complete algorithm for X. There

are no sound, complete and terminating algorithms for X. Any sound and complete algorithm for Xmust also be terminating. The Halting problem for Turing Machines is undecidable.