Let X be defined as follows:

X: Given M an encoding of a Turing Machine. Does M halt on all inputs?

Which of the following is true?

- X is decidable
- X is undecidable but partially decidable
- X is undecidable and not even partially decidable
- X is not a decidable problem

Please answer with explaination.