Please provide answer for problem 4

MORE THAN ONE SOLUTION WILL BE APPERCIATED. Please dont post image as solution.

0-ax,R. 0-+R FIGURE 3.8 State d for Turing machin e Mz FIGURE 3.10 State diagram for Turing machine M Problem 4 Give a clear description of a TM that ognizes the language A- K0 #0"#0" "Im n? rec other words, a string belongs to A ifand only if it consists of three #-delimited strings of 0s such hat the number of0s in third s ng is equal to the number of 0s in the first s ng minus the number of 0s in the second string. Note that the constraint m>n? mplies that all three strings of 0s are nonempty. Your description should be clear and detailed. You do not have to write a Turing machine program (e.g., like Figure 3.8 or Figure 3.10 of our text), but it should be possible to write such a program based on your description x R. 0,1,x