Design a Turing Machine that accepts all binary words in the form of a∗b∗a∗.

Use JFLAP software only. for turing machine

language. Use JFLAP to draw the state diagram of a Turing machine that recognizes the following L= {w€ {a,b}*|w contains more a, than be}

Design a Turing machine M that decides the language L = {0"1" |n> 1}.

2) Recall that a final state of a Turing machine T is a state that is not the first state in any of the 5-tuples that make up T. Construct a Turing machine that recognizes the set {0²n1n | n ≥ 0}. Write down 5- tuples for the Turing Machine. (You will not receive credit if you only draw an FSM.)

) Build a Turing Machine over the alphabet Σ = {a,b} that accepts all words which do not start andend with the same letter. Show the execution traces with the following input strings:(a) Λ(b) abba(c) baba

Construct a Turing machine that accepts the complement of the language L = L (aaaa∗b∗). Assume that Σ = {a, b}.

Design a Turing Machine that accepts the language {a^cb", n >0}