Consider the language
$L = \{ww:w\in\{a, b\}^+\}$.
Discuss the construction and efficiency of algorithms for accepting $L$ on
$\text(a)$ a standard Turing machine,
$\text(b)$ on a two-tape deterministic Turing machine,
$\text(c)$ on a single-tape nondeterministic Turing machine,
$\text(d)$ on a two-tape nondeterministic Turing machine.
