1) Show that the language of bitstrings of the form wtw or wow are palindromes of odd length. isn't regular. (Recall wA means the string w written backwards.) Notice these bitstrings 2) Consider that language of bitstrings that either have even length (e g 100101) or are not palindromes (eg. 10011). This language cannot be regular given the result of question 1. Explain why 3) Show that the language in question 2 is context free. 4) Give a CFG for bitstrings that contain twice as many o's as T's 5) Give a CFG for bitstrings with zero or more o's followed by at least as many 1's. 6) Give a CFG for bitstrings with at least two o's. (This is easier than it seems.) 7) Give a CFG for bitstrings not containing 01. 8) Give a CFG for bitstrings with 2k 1's followed by 3k o's, where ko