Write a program to find N$!.$ The program must contain a loop$(!)$ and produce some output. The RSC uses the following instruction set.

The list is separated by bytecode and alternate text.

$```$

$00$: halt,stop

$01$: lda,ldac,ldacc

$02$: stac,stoac,stacc,stoacc

$03$: movac,mvac,movacc,mvacc

$04$: movr,mvr

$05$:jmp$,$jump

$06$:jmpz$,$jumpz

$07\}\backslash$mathrm$\{$ : out,output,outr

$08$: sub

$09$: add

$0$a:inc,inac,inacc,incacc

$0$b : clac,clearac,clacc,clearacc

$0$c

$0$d:or

$0$e:ras,ashr,asr

Of: not

$```$ Variables$/$Storage locations are allowed, and can be declared as follows:

var $01$

or

var

$01$

Instructions have alternate texts you can use for readability.

LDA $0001$ or $010001$ or LDA var$1$

Comments are allowed and are denoted by a semicolon.