Design a Turing machine that would take an input of the form $1^$n $($i$.$e$.,1$ repeated

n times$)$ and generate an output of the form $1^(2$n$)$

$.($i$.$e$.,$ the TM is duplicating the

input$)$ Design the table as: Current state, Next tape symbol$($tuple$($next state, what the symbol was replaced with, moves$($r or l$)))$