P3. Show using pumping lemma that the language {1* } is not regular (1 to power ). P4. Let L be the language of all binary palindromes (.e. W = w-reversed). (a) Construct a CFG for L and then convert it to Chomsky normal form (b) Construct a PDA for L P5. Show that {