2. Let M2 be the Turing Machine diagram as follow: a/a R Y/YR B/BR a/a R a/XR 9 9. b/YR Y/YR b/b R Z/ZR X/XR B/BR C/ZR Y/YR Z/ZR B/BR | c/ZL a/a L b/b L Y/YL Z/ZL 96 a) Trace the computation of M2 on input string aabcc. b) Give TWO (2) other strings that will be accepted by the Turing Machine. c) Give a set-theoretic definition to define the language. 2. Let M2 be the Turing Machine diagram as follow: a/a R Y/YR B/BR a/a R a/XR 9 9. b/YR Y/YR b/b R Z/ZR X/XR B/BR C/ZR Y/YR Z/ZR B/BR | c/ZL a/a L b/b L Y/YL Z/ZL 96 a) Trace the computation of M2 on input string aabcc. b) Give TWO (2) other strings that will be accepted by the Turing Machine. c) Give a set-theoretic definition to define the language