4. Use process of elimination to find the language of the following FA 0,1 Start 0,1 So S1 0 5. Let T be the Turing Machine defined by the five tuples: (S0,0,S1,1,R), (S0, 1,S1,0,R), (S0,B,S1,0,R), (S1,0,S2,1,L), (S1,1,S1,0,R), (S1,B,S2,0,L). For the following initial step, determine the final tape when T halts, assuming that T begins from the initial position