I$\text{'}$m writing a code to use in a Java$-$Based ASM emulator for a lab that will take a number, and find its cube, $($N$^3).$ Keep in mind that instructions are limited and syntax is strict. I ask that you only work on this one if you have experience with this specific java emulator $($picture included$),$ since they are so finicky and different. Thank you very much. Here is the code snippet:

; Store the value of n in memory

LDAC $80$ ; Load n from memory $($address $80)$

STAC $81$ ; Store n at address $81$ for later use

; Step $1$: Calculate n$^2($n $*$ n$)$ using repeated addition

LDAC $81$ ; Load n into the accumulator $($n$)$

STAC $82$ ; Store n at address $82$ for n$^2$ loop $($temporary storage$)$

LDAC $0$ ; Load $0$ into the accumulator $($initializing sum$)$

STAC $83$ ; Store $0$ at address $83($n$^2$ accumulator$)$

; First addition: n $+$ n

LDAC $83$ ; Load n$^2$ accumulator

ADD $82$ ; Add n to n$^2$ accumulator $($first addition$)$

STAC $83$ ; Store updated value in n$^2$ accumulator

; Second addition: n $+$ n

LDAC $83$ ; Load n$^2$ accumulator $($current value$)$

ADD $82$ ; Add n to n$^2$ accumulator $($second addition$)$

STAC $83$ ; Store updated value in n$^2$ accumulator

; Third addition: n $+$ n

LDAC $83$ ; Load n$^2$ accumulator $($current value$)$

ADD $82$ ; Add n to n$^2$ accumulator $($third addition$)$

STAC $83$ ; Store updated value in n$^2$ accumulator

; Now n$^2$ is computed, stored in address $83$

; Step $2$: Calculate n$^3($n$^2*$ n$)$ using repeated addition

LDAC $83$ ; Load n$^2$ into the accumulator $($n$^2)$

STAC $84$ ; Store n$^2$ at address $84$ for n$^3$ loop $($temporary storage$)$

LDAC $0$ ; Load $0$ into the accumulator $($initializing sum for n$^3)$

STAC $85$ ; Store $0$ at address $85($n$^3$ accumulator$)$

; First addition: n$^2+$ n$^2$

LDAC $85$ ; Load n$^3$ accumulator

ADD $84$ ; Add n$^2$ to n$^3$ accumulator $($first addition$)$

STAC $85$ ; Store updated value in n$^3$ accumulator

; Second addition: n$^2+$ n$^2$

LDAC $85$ ; Load n$^3$ accumulator $($current value$)$

ADD $84$ ; Add n$^2$ to n$^3$ accumulator $($second addition$)$

STAC $85$ ; Store updated value in n$^3$ accumulator

; Third addition: n$^2+$ n$^2$

LDAC $85$ ; Load n$^3$ accumulator $($current value$)$

ADD $84$ ; Add n$^2$ to n$^3$ accumulator $($third addition$)$

STAC $85$ ; Store updated value in n$^3$ accumulator

; Now n$^3$ is computed, stored in address $85$

; Output the final result

LDAC $85$ ; Load n$^3$ from memory

OUT ; Display the result of n$^3$

HALT ; End program execution