Consider the following Turing Machine. Its input alphabet is {0,1}. Transitions to the REJECT state are not shown ("if stuck, then reject"). A 1- R 3 UR accept 0 L,R UR U-blank 5 0,1,R UL 0L,L 0,1,L 1. (10 points) Exhibit a non-empty string over {0,1} that this TM accepts. 2. (10 points) Exhibit a non-empty string over {0,1} that this TM does not accept. 3. (5 points) What language does this TM accept? (You should characterize it in terms of properties of the accepted strings). Consider the following Turing Machine. Its input alphabet is {0,1}. Transitions to the REJECT state are not shown ("if stuck, then reject"). A 1- R 3 UR accept 0 L,R UR U-blank 5 0,1,R UL 0L,L 0,1,L 1. (10 points) Exhibit a non-empty string over {0,1} that this TM accepts. 2. (10 points) Exhibit a non-empty string over {0,1} that this TM does not accept. 3. (5 points) What language does this TM accept? (You should characterize it in terms of properties of the accepted strings). Consider the following Turing Machine. Its input alphabet is {0,1}. Transitions to the REJECT state are not shown ("if stuck, then reject"). A 1- R 3 UR accept 0 L,R UR U-blank 5 0,1,R UL 0L,L 0,1,L 1. (10 points) Exhibit a non-empty string over {0,1} that this TM accepts. 2. (10 points) Exhibit a non-empty string over {0,1} that this TM does not accept. 3. (5 points) What language does this TM accept? (You should characterize it in terms of properties of the accepted strings).