Please, design an enumerator (a.k.a. a Turing machine with a printer) that enumerates the following language:

L := {aⁿbⁿ : n is odd}.

Please, describe the algorithm informally and then write a formal definition of the enumerator. For printing you may use a special state of the machine: q_print. The transition function can be defined by means of a diagram or as a list of assignments.