1. Given a Turing Machine T , are there any input strings on which T loops forever? 2. Given a Turing Machine T and a string w, does T reject input w?

Question

1. Given a Turing Machine T , are there any input strings on which T loops forever?
2. Given a Turing Machine T and a string w, does T reject input w?

How to prove the above two question's decidabiltiy , I understand these are undecidable but can someone help me prove that they are undecidable with the concepts of reducability.