a$)$ Draw the DFA that, for the alphabet Sigma$=(0,1)$ accepts all strings that do not have any consecutive $0\text{'}$s or $1\text{'}$s $($e$.$g$.,0,0101,101,$ and $10$ are accepted but $11,001$ and $01001($k$)$ are not accepted$).(7$ marks$)$

b$)$ Describe what a halting problem is in Turing Machines $(3$ marks$).$

$3.$ a$)$ With the knowledge you have attained about Turing machines, list and describe the types of Turing machines $(16$ Marks$).$

b$)$ Describe what a Turing Machine is$?(4$ marks$).$