Give the state diagram of a Turing machine which begins with $w$# on its tape for any $win{}^{*}$ and halts with $w$#$w$ on its tape. The input alphabet is $=\{a,b\}$ and the tape alphabet may be$...$

$($Please look the screenshot and answer question $1$ and $2!!!)$