Solve the 4th question

executable program into memory lll machine can compute anything that any other Turing machine can. 12. Turing s 13. Although there is no algorithm to design a Turing machine, the set of mant chapter help us in designing an accurate Turing machine for a given problem 10.12 Exercises A. Construct a Turing machine to perform each of the functions given below. Also show an a ing sequence of configurations for each of the following example strings. 1. Accept all odd palindromes over fa, b) (where the symbol at the middle is also a or b. s an accepting sequence of configurations for the input baaaaab. 2. Accept the language of the Regx:aba)%a + b)*(ba+ ab). Show how it rejects ababaa 3. Accept all positive binary numbers divisible by 4. 4. Separate a given string into two equal halves by finding the midpoint of the given string and inserting a blank at that point. For example, given abbaab, the output shall be abb aab. 5. Break a given string into three equal parts. Show an accepting sequence of configurations for the input abbbaabba, the expected output being abb baa bba. 6. Match properly nested parentheses. Show an accepting sequence of configurations for (000)0)