a Considering the TM pictured, $\backslash$Sigma $=$ Q $=$ T $=$ b$.$ Is this machine deterministic or nondeterministic? c$.$ This particular machine halts $($choose one$)$ : always $($on all inputs$),$ sometimes, never, can't know for all possible inputs d$.$ What is this machine doing for an arbitrary input string of a$\text{'}$s and b$\text{'}$s$?$ What is it$?$ Please thoroughly explain everything!