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

{w : w contains the same number of 0s as 1s}