creating JFLAP TM as a $.$jff file

$(12\mathrm{.}5$ points$/5$ extra credit points for the minimal correct solution. Submit your solution as a modifed version of H$1-$template.jff$,$ submitted with the HW materials$).$The input to TM M is s$$$s$,$ where s$$ and s$$ are strings of $1\text{'}$s and $0\text{'}$s$.$ Neither s$$ or s$=.$ If s$=$

s$,$ the output is s$=$s$.$ When s$$ and s$$ are interpreted as the binary numbers n$$ and n$$ respectively, with leading zeroes ignored, the output is s$+$s$$ if n$=2*$n$+1$; s$$s$$ if n$>$ n$.$ A correct implementation of M will have the transducer results

below for the inputs in test$\_$cases.txt$,$ also included with the HW materials.

Input Output Result

$101$$$0101101=0101$ Accept

$0101$$$1010101=101$ Accept

$101$$$101101=101$ Accept

$101$$$01011101+01011$ Accept

$0101$$$010110101+01011$ Accept

$01$$$01101+011$ Accept

$0$$$10+1$ Accept

$101$$$11101>11$ Accept

$10$$$110>001$ Accept

$11$$$1011>10$ Accept

$01$$$1001<mn\; id="EditorElement\_1246245">1</mn><mn\; id="EditorElement\_1246246">0</mn>$ Accept

$1$$$101<mn\; id="EditorElement\_1246280">1</mn><mn\; id="EditorElement\_1246281">0</mn>$ Accept

$11$$$10111<mn\; id="EditorElement\_1246317">1</mn><mn\; id="EditorElement\_1246318">0</mn><mn\; id="EditorElement\_1246319">1</mn>$ Accept

$1$$$101<mn\; id="EditorElement\_1246352">1</mn><mn\; id="EditorElement\_1246353">0</mn>$ Accept

H$1-$template.jff encodes a partial implementation of M; the only thing missing is the $\text{'}+\text{'}.$ Enhance

the template to fully implement M$.$ To run the test cases in transducer mode, select Multiple Run

$($Transducer$)$ from the Input menu $($or type $$T on a Mac$),$ and then select Load Inputs from the buttons at the bottom of the right panel.

test$\_$case.txt:

$101$$$0101$

$0101$$$101$

$101$$$101$

$101$$$01011$

$0101$$$01011$

$01$$$011$

$0$$$1$

$101$$$11$

$10$$$1$

$11$$$10$

$01$$$10$

$1$$$10$

$11$$$101$

$1$$$10$