a Turing Machine for the

set of all string over the language given by $\{0^$n$+11^$n $|$ n$>=0\}$ include old state, old symbol, new symbol, new state $,$move in the table