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 STAE, STATE SYMBOLS $(1,$ X$,$ B$)$ AND FOR THE STATE SYMBOL WRITE THE TRANSITION IN THIS FORM $($p$,$Y$,$D$)$