State the pumping lemma for regular languages.

Which of the following languages over the alphabet $\{0,1\}$ are regular?

(i) $\left\{0^{i} 1^{i} 01 \mid i \geqslant 0\right\}$.

(ii) $\left\{w \bar{w} \mid w \in\{0,1\}^{*}\right\}$ where $\bar{w}$ is the reverse of the word $w$.

(iii) $\left\{w \in\{0,1\}^{*} \mid w\right.$ does not contain the subwords 01 or 10$\}$.