Can you 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 Os and Is

$.$

$$The machine should negate the whole block

$($

as in every

$1$

$$becomes a

$0$

$$and every

$0$

$$becomes a

$1)$

$,$

$$and then returns True if the second character