Draw transition diagram of a TM for the language L2 = {a^n * b^(2n) c^(n+1) | n 2}. Check if this TM accepts the string 'aabbbbccc' using IDs.

2. Draw transition diagram of a TM for the language L2 = {a"b2ncn+1 | n2 2}. Check if this TM accepts the string aabbbbccc using IDs