Language {a^(n+1) b^(n+1) a^(n+1)|n> } Descriptive Definition: *n+1' number of A's and 'n+l' number of B's are followed by same n+l number of A's. Where n>0. Words: {aabbaa, aaabbbaaa, aaaabbbbaaaa aaaaabbbbbaaaaa, aaaaaabbbbbbaaaaaa,aaaaaaabbbbbbbaaaaaaa, aaaaaaaabbbbbbbbaaaaaaaa, aaaaaaaabbbbbbbbbaaaaaaaaa, aaaaaaaaaabbbbbbbbbbaaaaaaaaaa Q: Write a code for Turing Machine which accept the following Language. Write code in (C or C++ or Python or Java)