You are required to build a Turing machine for the given language is L= {1 n 0 n 2 n } where n>=1. Also derive the give string {000011112222} to evaluate that either the designed machine accept the given string or not.

(Note: Kindly answer the full question and also according to the given scenario. Most of the Chegg answers are not up to the mark and most experts are not experts at all. They just try to answer quickly without taking care of the quality.

If you don't have in-depth knowledge about the topic then don't answer it.)

Q1. You are required to build a Turing machine for the given language is L= {1" O2} where n>=1. Also derive the give string {000011112222} to evaluate that either the designed machine accept the given string or not. (6)