Getting started with JFLAP can be challenging, and everyone will have another chance this week. The assignment is to take either the student or prof solution attached below, and enhance it to change the $\text{'}$$$\text{'}$ to a $\text{'}!\text{'}$ if there are $3$ more significant digits in n$1$ than in n$2.$ I'll only consider submissions that match the test case results exactly $101$$$0101$

$0101$$$101$

$101$$$101$

$101$$$01011$

$0101$$$01011$

$00000$$$1$

$10$$$1$

$0101$$$000100$

$10101$$$1$

$111$$$1$

$111$$$00000$

$0100$$$01$

$1011$$$1$

$1011$$$00000$

$01000$$$01\backslash$table$[[$Input$,$Output,Result$],[101$$$0101,101=0101,$Accept$],[0101$$$101,0101=101,$Accept$],[101$$$101,101=101,$Accept$],[101$$Accept$],[0101$$Accept$],[00000$$Accept$],[10$$$1,10>1,$Accept$],[0101$$$000100,0101>000100,$Accept$],[10101$$$1,10101>1,$Accept$],[111$$$1,{111}^{**}1,$Accept$],[111$$$00000,111**00000,$Accept$],[0100$$$01,{0100}^{**}01,$Accept$],[1011$$$1,1011!1,$Accept$],[1011$$$00000,1011!00000,$Accept$],[01000$$$01,01000!01,$Accept$]]$