$3\mathrm{.}1$ Construct a Turing machine that accepts the language L $=\{0^$n # $1^$n$+1|$ n $1\}.$ Assume that the machine always starts with a non$-$null string in $\{0,1,$ #$\}$ as input.

$3\mathrm{.}2$ Using IDs, show the execution sequence of your machine for the input $0$#$11.$

$3\mathrm{.}3$ Using IDs, show the execution sequence of your machine for the input $0$#$1.$