As all recursive languages are recursively enumerable languages, they also should be Turing Recognizable together with Turing Decidable. This was my logic behind marking the 4th option which says all of the mentioned statements are true.
Correct me if I am wrong