6. Consider the following Turing Machine for {a^n b^n c^n}. Determine whether each of the following input tapes is accepted or not and find in which state the machine halts and how the tape has been...

Extracted text: 6. Consider the following Turing Machine for {a^n b^n c^n}. Determine whether each of the following input tapes is accepted or not and find in which state the machine halts and how the tape has been changed at halt. See the example in the table below, and fill the rest of the table. [Note: e stands for empty string] B/B,R a/X,R b/b,R a/a,R Y/Y,R b/Y,R 91 92 c/ZL a/X,R X/X,R 93 1'0/0 Y/Y,R Y/Y,L Z/ZL B/B,R Y/Y,R U ZIZR 2 Input Tape Аcсeptable? The state at halt Output Tape abccba No 95 XYZcba aabbcc aabbbc cba