Draw a Turing machine which compare two numbers. The machine must have three accept states. The three labels of the accept states are: A $=$ B$,$ A $>$ B$,$ and A $$ B$,$ respectively.

Use one$$s for the representation of the two numbers $($for example, $3$ is represented by $111$ and $2$ is $11),$ the $0$ is used to separate both numbers, and B means a blank.

The following three examples show the configuration of the machine for: $3=3,$ then, $3>2,$ and finally,