Problem 6 Given a standard Turing machine M, argue that it can be simulated by a FIFO queue automaton S, as described in Problem 3.14. Your S should be deterministic. You should also state a "slowdown bound for your simulation. That is, put a big-Oh bound on the number of steps that S needs, to simulate T steps of M on an input of length n. Problem 6 Given a standard Turing machine M, argue that it can be simulated by a FIFO queue automaton S, as described in Problem 3.14. Your S should be deterministic. You should also state a "slowdown bound for your simulation. That is, put a big-Oh bound on the number of steps that S needs, to simulate T steps of M on an input of length n