Solve the 6th question

machine can compute anything that any oller Tu 13. Although there is no algorithm to design a Turing machine, the set of mantras chaper help us in designing an accurate Turing machine for a given problem. two abse the 10.12 Exercises Construct a Turing machine to perform each of the functions given below. Also show an ing sequence of configurations for each of the following example strings. I. Accept all odd palindromes over la. b) (where the symbol at the middle is also a or by, Sho 15. Fir an accepting sequence of configurations for the input baaaaab. 2 Accept the language of the RegEx: (ab + bala + b)*ba + ab). Show how it rejects ababon 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. string and 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 Coomo)