05 Turing Machine for Recognizing the Language L = a^n b^n c^n | n ≥ 1

Design and explanation of a Turing Machine that accepts strings belonging to the language L = a^n b^n c^n where n is greater than or equal to 1.