a) Draw a state diagram for a Turing Machine to recognize Language bb* , where Σ={b}. Explain how your TM works and why it is correct. Define your designed TM formally by expressing its tuple parts....

a) Draw a state diagram for a Turing Machine to recognize Language bb* , where Σ={b}. Explain how your TM works and why it is correct. Define your designed TM formally by expressing its tuple parts. b) Now let the input string be bbbb . Run your machine on this input and show step by step how this string is accepted by your TM.