Turing Machine for Recognizing a^n b^n

An essential concept for the theory exam, this discusses the design of a Turing machine that recognizes strings of the form a^n b^n, where n ≥ 1.