4.1.1: Prove that the following are not regular languages (using pumping lemma). e. {0^n1^m | n =1}

4.1.1: Prove that the following are not regular languages (using pumping lemma).

e. {0^n1^m | n<=m}

f. {0^n1^(2n) | n>=1}