Problem $1($Tape$-$head level description of a TM$)$

$10$ pts

Give a "tape$-$head level description" of a Turing Machine that recognizes the language $L=$

$\{0^n{1}^{n^2}$:$n1\}.$ Do not draw a state diagram, but carefully describe the strategy of how

to move on the tape, what to write on the tape $($including special symbols you may use and what

they denote$),$ etc., like we did in class.