Theory of computation

L= { a^p b^m a^3m b^2p , where p,m>=1}

Consider the following language, Labmb where p. m >=1) where - (ab} 0) Construct a Turing Machine that accepts "L'18 Marks) (8) Demonstrate the functionality of TM for the input "abaaabb" with the instantaneous description of the TM for every symbol of the given input (2 Marks)