Problem 4 Turing Machines Construct a Turing machine that accepts or reject the set of all bit strings that contain at least two consecutive 1's. You need to define the state transition table in the format used in lectures. That is, f (si, a) = (sj, A, R) where s, is the current state, s, is the next state, a is the input symbol, A is the output symbol written on tape, and L indicates moving left or R indicates moving right. At the end of processing the tape input will be unchanged, but 0(reject) or 1(accept) will be written to the right of A Examples. input tape ---- ouput tape A 011001 A --- A 011001 A 1A010101A --- A010101A0