[15 points] Give a Turing Machine in the form of a transition function to do each of Problem 1. the following. (a) The input alphabet is -{a). The machine halts if the input is a string with an even number of a's, and it hangs otherwise. In other words, it implements the language in Turing Acceptable form. (b) Write a version of the machine that solves the same problem (the input is a string of a's, and we want to know if its length is even). But now, implement it to be Turing Decideable. Specifically, an input string w with starting configuration (s, #w#) will go to the configuration (h#Y#) if the string is an even number of a's, and it will go to the configuration (h, #N#) otherwise