a) Design a Turing Machine for the language, L = {2n| where n > = 0, ∑ = {0, 1} } b) Construct Transition table for the designed Turing machine in the PART (a) c)Differentiate between Turing Machine...

a) Design a Turing Machine for the language, L = {2n|  where n > = 0, ∑ = {0, 1} }

b) Construct Transition table for the designed Turing machine in the PART (a)

c)Differentiate between Turing Machine and Linear Bounded Automata?

Please solve the above three parts, Thank you.