Give the state diagram of a Turing machine that decides each of the

following languages over $\{0,1\}$:

a$.$ L$$

b$.\{$w: w $!=\backslash$epsi $)$

c$.\{$w: $|$w$|<3\}$