Question: A language solved in quadratic time implies the use of what type of Turing machine?

Is For instance, the language {xx | x is any binary string} can be solved in linear time on a multi-tape Turing machine, but necessarily requires quadratic time in the model of single-tape Turing machines. a good answer to this question?

OPTIONS:
- yes
- no
yes