Which of the following is true about the given statements?

I. Non-deterministic Turing machine is more powerful than deterministic Turing machine

II. Non-deterministic pushdown automata with two stacks is equivalent to deterministic Turing machine

III. \(L = {\rm{\{ }}\;ww{w^r}\;{\rm{|}}\;w\;\epsilon\;{\left\{ {a,b} \right\}^*}\} \)  is accepted by Turning Machine