Consider the Turing Machine $($TM$)$ T $($over the input alphabet $=\{$a; b$\})$ given below.

a$)$ What is the shortest word that would be accepted by T$?(1)$

b$)$ What is accept$($T$)?(2)$

c$)$ What is reject$($T$)?(2)$

d$)$ What is loop$($T$)?(1)$