Answer Happy

Question 3) (15 points) We want to design a Copy Turing Machine. The machine starts with a tape with BwB, where B is the Blank symbol and we {a, b}* is the input string, and results in BwBwB on the tape. Here is an example of how this TM works: let w=abb, the tape content initially is as follows: | В Blabb 1B | The rest of tape content here is blank as we studied in the course The TM copies the string and results in: a b b B b alb blb (1) Draw the “state diagram” for your Copy TM as discussed above. (2) Explain how your TM solves the given problem. (3) Use “yield” relation and show how your TM works on the input w=bab. Show all your work.