Question 2 (10 marks) Use the Pumping Lemma to prove that both of the following languages of binary strings are not regular: (a) The language of all binary strings with the same number of Os and 1s. For example, 00101011 belongs to this language while 111100 and 0010110 do not. (b) The language of all binary strings whose lengths are powers of 2, that is, every string in this language satisfies lol 2", for some integer n 0