Give an informal description of a deterministic Turing machine for the language L = {we {0, 1}* w has different number of 0's and 1's }