Use JFLAP to create a Turing machine transducer that computes the function

$f(n)=n+5$ for $n1$

The inputs and outputs of $f$ are in unary notation. This means that if $n=3,n$ is written as$.111$ and then $f(111)=11111111.$ See examples in the slides from Chap $9\mathrm{.}1$ Part $3.$

$[$You must create a Turing Machine transducer and you use unary notation and the methodology described in the Chap $9\mathrm{.}1$ Part $3$ slides. to get credit for this problem$]$

Use the following strings as test cases: $1,11,111,111111,111111111$

Submit your diagrams of your Turing Machine and test cases.

In the answer for chegg please attach the diagram for the turning machines and tedt cases. Other wise will be voted incorrectly.