Let us consider the following three statements:

I. Recursively enumerable languages are those that can be accepted by a Turing machine;

II. Recursive languages are those that can be decided by a Turing machine;

III. A recursively enumerable language accepted by a Turing machine that halts is recursive.

Which of the following holds?

a.Only I; b.Only II; c.Only I and II; d.Only II and III; e. All I, II, and III.