Answer all the questions. Unless otherwise stated, all the languages considered in this homework use { = {0,1} as the alphabet. Problem 1 (50% Pumping lemma for regular languages) Given a binary string s (s may be the empty string), we denote ni(s) = no of copies of i in the string s (i = 0,1). Note that, no(e) = 0 = n1(e). Now, let L1 = {w | no(w)