Provide a “high-level” description for Turing machines that accept the following languages on $\{a,b\}.$ For each problem, define a set of appropriate macroinstructions that you feel are reasonably easy to implement. Then use them for the solution.
$\text{The complement of the language in }L = \{ww^R\}.$
