Create a Turing machine with Sigma $=\{0,1\}$ which decides the language:

L$1=\{$w$|$ w in $\{0,1\}*\}$ and w contains exactly two times as many $0$ s as $1$ s$.$

I do not want an answer like: $1$; X$,$R $1,1,$R $0,0,$R XXR XXIR $1$;L$,$R X;X$,$R $929,$ D; IL lo OR $0$;$0,2$ X;X$,$ L$.0,$X$,$R $931$; XL ax D;$0,4$ D:D$,$ R $950$;$0,$ L $1,1$L DOR F X$.$ I have no idea how to translate this.

Please create the Turing Machine with nodes, preferably in Jflap or on paper. Thank you!