Solve the 5th question

machine can compule a 13. Although there is no algorithm to design a Turing macHIIL, lI 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 sho an sequence of configurations for each of the following example strings. L. Accept all odd palindromes over la. b) (where the symbol at the middle is also a or b). Sho an accepting sequence of configurations for the input baaaaab 2. Accept the language of the RegEx: (ab+ baa + 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 strin g and ven string into three equal parts. Show an accepting sequence of configurations for the 6. Match properly nested parentheses. Show an accepting sequence of configurations for inserting a blank at that point. For example, given abbaab, the output shall be abb aab. input abbbaabba, the expected output being abb baa bba. (000)0) 5. Break a gi