Design a deterministic single$-$tape Turing Machine with input alphabet $\{0,1\}$ that does not use macros and starts on the leftmost character of a nonempty block of $0$s and $1$s$.$ The machine negates the whole block $($i$.$e every $1$ becomes a $0$ and every $0$ becomes a $1),$ and then returns True it the second character of the original block was a $1$ and False otherwise. The location of the head when the machine returns is irrelevant.The Turing Machine must have no more than $25$ states