2. (16 points) Give implementation-level descriptions of Turing machines that decide the following language over the alphabet {0,1}. In implementation-level description, we use English prose to describe the way that the Turing machine moves its head and the way that it stores data on its tape. See examples of implementation-level descriptions in the book Examples 3.7, 3.11, and 3.12. {ww contains twice as many 0 s as 1 s }.