2. (30 points) Define the following languages using the set notation from class/the text- book, without any continuation dots (...), i.e. similar to how we defined the language of all palindromes, or the language of all even binary numbers. For each language list at least 3 words that are in the language, and 3 that are not (you are not allowed to reuse the examples that are already given for this). (a) (5 points) The language of all palindromes of odd length over the alphabet ? = {0,1} (b) (5 points) The language of all words of length at least 4, that represent binary numbers (without leading zeroes) that start and end with the same two digits (in the same order) over the alphabet S = {0, 1}. This means 1010, 100000010, 11011 would all be valid words, but 1001, 11000000 and 0101 would not be. (c) (5 points) The language of all words of length at least 2 that contain the first two letters (in lower case; in a latinized transliteration or transcription if necessary) of your preferred name (please state these letters separately and clearly) in the correct order anywhere within the word over the alphabet