machine 13. Although there is no algorithm to desig chapter help us in designing an accurate Turing machine for a given 14. twc 10.12 Exercises A. Construct a Turing machine to perform each of the functions given b the elow. Also show an 15. Fi uence of configurations for each of the following example strings.w 1. Accept all odd palindromes over la, b) (where the symbol at the middle is also. a or b). Stov an accepting sequence of configurations for the input baaaaab. 2. Accept the language of the RegEx: (ab + ba(a + b)*(ba + ab). Show how it reje 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 inserting a blank at that point. For example, given abbaab, the output shall be abb aab. 16. 17 5. Break a given string into three equal parts. Show an accepting sequence of configuration input abbbaabba, the expected output being abb baa bba. s forth 6. Match properly nested parentheses. Show an accepting sequence of configurations fi 000o