PLEASE SHOW STATE DIAGRAMS FOR ALL THE THREE OR AT LEAST ANSWER NUMBER 1.

Consider the language L = {a^2^n n greaterthanorequalto 0}. Construct the state diagram for TM? Answer: Consider the language L = {a^n b^n c^n: n greaterthanorequalto 1}. Construct the state diagram for TM? Answer: Construct a Turing Machines to calculate the product of two positive integers (x and y) represented in unary notation