Now update the program you decoded in Task $2\mathrm{.}1.$ Removing all hard$-$coded memory

addresses by adding labels to replace all memory locations that are used as addresses

in the program instructions. Labels should have meaningful names in the context of what

the program does $($i$.$e$.,$ not just A$,$ B$,$ C$).$ For the example above, this could result in the

following program:

Start, Jump $005$

Dec $0$

Dec $0$

Dec $0$

Dec $0$

MainRoutine,JnS $00$B

Load $00$A

Store $002$

JnS $010$

Jump $01$F

Dec $0$

Dec $0$

Input

Store $00$A

JumpI $00$B

Dec $0$

Dec $0$

Load $028$

Skipcond $000$

Jump $015$

JumpI $010$

Load $027$

Subt $028$

Store $00$F

Load $028$

Subt $020$

Store $028$

LoadI $00$F

Add $002$

StoreI $00$F

Jump $011$

Halt

Dec $1$

HEX $01$B

Hex $34$

Hex $35$

Hex $30$

Dec $4$

Hex $24$

Hex $26$

Dec $5$