For each decision problem below, determine whether it is decidable or undecidable, and prove your answer.

Given a TM T $,$ are there any input strings on which T loops forever?

Given a TM T and a string w$,$ does T reject input w$?$

can you explain with examples