Solve the 11th question. Construct a Turing Machine for the following function and show an accepting sequence of configurations for the example string given

ion of km- mputed carn model that e Church- (b) -a'be where e) -a-d where k n-mifn> m and the first number is negative: for example, -aaaabb ce (d) arrr' where k n-m if n m and the second number is negative, for example, (e) a-bd where k-m -n if m > n and the second number is negative: for example. ack, semi- equivalent e standard (D a-d where k-n+ m and both numbers are negative; for example,-aaa-bbb-cccocc. the output is the second number, which is indicated by writing a 1 onto the tape: 1001 11000 1 (similarly a 0 if the first number is the maximum of the two or if the two numbers are the same). 10. Find the maximum of two positive binary integers. For example, given 1001 11000 as input ulate the 12. Copy a given string, that is, the tape should contain a second copy of the input string separated 13. Accept strings of the form at'b'o'd. Show an accepting sequence of configurations for the input 14. Check if the first part of the string is present as a sub-string of the second part of the string, the 11. Reverse a given string. Show a sequence of configurations for the input strings ababbb. e is first code. t load an l Turing by a single blank cell from the given string aaabbbeccddd and show how aaabbbcccedd is rejected. two parts being separated by a single blank cell. The output shall be a 0 or a 1 indicating the absence or presence of the sub-string in the given string, respectively. Show the computation for the input 011 001011011. d in this 15. Find the index of a symbol in a given string, that is, given a symbol followed by a blank and a string, for example, a bebaaba, it finds the first position where the given symbol occurs in the