Solve the 13th question. Construct a Turing Machine for the following function and show an accepting sequence of configurations for each of the example strings

gh, Alan a limitation of nm and bth fiullies e piu (a) ab" where k re k- m-n if m 2 n and the first number is negative; for example, -aabbbbcc. e) -a-d where k-n-mif n> m and the first number is negative:; for example, -aaaabbc number is negative; for example, computed can ing model that The Church- (e) a-b- where k - m - n if m> n and the second number is negative; for example (D) b where k n+m and both numbers are negative; for example, -aaa-bbb-cccccc. the output is the second number, which is indicated by writing a 1 onto the tape: 1001 11000 1 aaaa-bbec. ti-track, semi- all equivalent the standard 10. Find the maximum of two positive binary integers. For example, given 1001 11000 as input, simulate the 11. Reverse a given string. Show a sequence of configurations for the input strings ababbb. 12. Copy a given string, that is, the tape should contain a second copy of the input string separated (similarly a 0 if the first number is the maximum of the two or if the two numbers are the same). hine is first le code. that load an rsal Turing Accept strings of the form a'bre'd. Show an accepting sequence of configurations for the input aaabbbeccddd and show how aaabbbccccdd is rejected. by a single blank cell from the given string. 14. Check if the first part of the string is present as a sub-string of the second part of the string, the for two parts being separated by a single blank cell. The output shall be a 0 or a l indicating the absence or presence of the sub-string in the given string, respectively. Show the comptation f the input 011 001011011. ssed in this s Find the index of a symbol in a given string, that is, given a symbol followed by a