Give the state diagram of a Turing machine that decides each of the following languages over {0,1}:

a. Empty language

b. {w : w )

c. {w : |w| < 3}