Which of the following statements are undecidable?

• A. For a given Turing Machine M,
• B. does M halt on an empty input tape
• C. does M halt for anly inputs at all?
• D. is L(M) regular? Context free? Turing decidable?
• E. all of the mentioned