$2$ Maximum score $30(6$ each part$)$

For the following TM$,$ with alphabet $\{0,1\},$ answer the following questions: $($a$)$ Is empty

string accepted? $($b$)$ The only symbol TM writes on the tape is #$.$ What does this suggest about

the role of that symbol? $($c$)$ If the input is a string of $990\text{'}$S$,$ what is the last state before

rejection? $($d$)$ What four symbol strings does the TM accept? $($e$)$ What is the language of TM$?$