Theory of Computation: Turing Machines?

im trying to design a turing machine that satisfies 0^(2n)1^(n) where n >= 0.
so an example of a string accepted by this turing machine would be 000000111
can anybody help me out?

im trying to design a turing machine that satisfies 0^(2n)1^(n) where n >= 0.
so an example of a string accepted by this turing machine would be 000000111
can anybody help me out?