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

{w#w : w {0,1}*}