Solve the 3rd question.. Construct a Turing Machine for each of the following functions. Also show an accepting sequence of configurations for each of the following example strings

inus discussed in 13. Although there is no algorithm to design a Turing hacle, ll chapter help us in designing an accurate Turing machine for a given problem 10.12Exercises A. Construct a Turing machine to perform each of the functions given below. Also show ar ing sequence of configurations for each of the following example strings. 1. Accept all odd palindromes over la, b) (where the symbol at the middle is also a o 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 rejects 3. Accept all positive binary numbers divisible by 4. 4. Separate a given string into two equal halves by finding the midpoint of the give inserting a blank at that point. For example, given abbaab, the output shall be abb input abbbaabba, the expected output being abb baa bba. (000). 5. Break a given string int an accepting sequence of configu 6. Match properly nested parentheses. Show an accepting sequence of cont