Halting problem of TM which recognize recursive languages is undecidable? I am preparing for an exam and I came across this question in one of the tests.


  Halting problem of Turing machines which recognize recursive languages
  is undecidable. (True / False)


The solution given says the statement its False.

But I think the statement is True. Halting problem in itself is undecidable. We can't determine whether the Turing Machine will halt or not.

The test series has a history of wrong answers that's why I am seeking an explanation even if I am wrong.

Edit:
I was looking at the answers and I have trouble understanding the explanations. I know that 'By definition, recursive languages are decideable by Turing machines.'
I will tell you how I breakdown the question. I am given a TM and told that this TM recognizes a recursive language. How do I know that the TM will halt?
By definition, recursive languages are decideable by Turing machines. Thus for recursive languages the TM will always halt.