Assuming a binary input and that the alphabet is Σ = {0,1,#} (where # represents a blank), design a Turing machine to check if the input is divisible by 4. Upon termination of the machine, the tape should contain a single (non-blank) symbol: ‘1’ if the original input is divisible by 4, and ‘0’ otherwise.

You can assume that the input includes at least one non-blank.

Hint: First consider what binary numbers are divisible by 2.

[7]