Answer Happy

Please answer the questions. It is either yes or no for the
answers.
Consider the function f(n) = n + 3 for n >= 1. We wish to create a Turing Machine transducer to compute f(n) for all input n>=1. For example if n = 4 then the input will be #1111# on the TM tape and the output will be #1111111# on the TM tape. The underline indicates where the r/w head should be. Decide which of the following Turing Machines is a Turing Machine transducer for f? M1 1:1,R 1:1.L 1:1.L. 01. D1.R 01.1 q1 92 93 OOR 94 95 Is M1 a Turing Machine transducer for f? (Select] M2 1:0,R 0,1,R 1:1,L 5. So 0:1, R 40 0:1.L DOR 91 92 Is M2 a Turing Machine transducer for f? (Select) M3 1:1.R 11.L 01 وہ سراسری سمجهنده 01,R 1 0: GO q3 94 Is M3 a Turing Machine transducer fort? [Select]