For each of the following languages, create a Turing machine for it. For parts a and b, you have to draw the Turing machine with all of its states and transitions. For parts c and d, you can either draw the machine or give a clear algorithmic description. Strings of a's, b's, and c's that contain the same number of o's and b's. Strings of a's and 6's of the form ww^R (even-length palindromes) (this is simpler than ww, since you're comparing the front to the back) Strings of just a's whose length is a power of 3. {a^i b^j| j = k middot i for some positive integer k} (for example, a^4b^12 would be in the language because 12 = 4 * 3)