Solution
= Solution
The <pumping lemma for regular languages> says that sufficiently long accepted words split as $xyz$ with $|xy|\leq P$, $|y|>0$, and $xy^kz$ accepted for all $k\geq0$. Applying it to $0^P1^P01$ pumps only zeros, so language (i) is not regular.