Consider the language L1 = {a∗aib∗bi | i ∈ N}. Construct a 2-tape Turing Machine T M1 that
accepts L1.
1. Provide three examples of l ∈ L1.
2. Describe the functionality of T M1 in natural language. (1pt)
3. Provide a state diagram for T M1.
4. State and justify the complexity of T M1.
