Informally but clearly describe multitape Turing machines that accept each of the languages of
- The set of strings with an equal number of $0's$ and $1's.$
- $\left\{a^{n}b^{n}c^{n}\ \mid n\geq 1\right\}.$
- $\left\{ww^{R} \ \mid \ \text{w is any string of 0's and 1's}\right\}.$
Try to make each of your Turing machines run in time proportional to the input length.
