Utilizing these two subroutines create a third subroutine per instructions.

PRINTDEC $-$ Print a $16-$bit number as decimal

$2.$ A $16-$bit number will be stored in R$0.$ You will have to figure out each digit one at a time and print

each.

$3.$ DO NOT PRINT leading zeros. Loop until a non$-$zero digit is found and then print the rest of the digits.

YOU CAN NOT ignore all zeros. Only ignore leading zeros.

$4.$ DO NOT PRINT a newline at the end.

$5.$ Your program should print a single $0$ if R$0$ is $0.$

Assume you have a number like $12345$ in R$0.$

Divide $12345$ by $10000$ to get $1,$ add $48$ and print it$.$

Divide $12345$ by $1000$ to get $12.$ Mod $12$ by $10$ to get $2,$ add $48$ and print it$.$

Divide $12345$ by $100$ to get $123.$ Mod $123$ by $10$ to get $3,$ add $48$ and print it$.$

Divide $12345$ by $10$ to get $1234.$ Mod $1234$ by $10$ to get $4,$ add $48$ and print it$.$

Divide $12345$ by $1$ to get $12345.$ Mod $12345$ by $10$ to get $5,$ add $48$ and print it$.$

Assume you have a number like $123$ in R$0.$

Divide $123$ by $10000$ to get $0.$ Ignore it$.$

Divide $123$ by $1000$ to get $0.$ Ignore it$.$

Divide $123$ by $100$ to get $1.$ Mod $1$ by $10$ to get $1,$ add $48$ and print it$.$

Divide $123$ by $10$ to get $12.$ Mod $12$ by $10$ to get $2,$ add $48$ and print it$.$

Divide $123$ by $1$ to get $123.$ Mod $123$ by $10$ to get $3,$ add $48$ and print it

; Division subroutine

DIV

ST R$0,$ PUSH$\_$R$0$ ; Save R$0$

ST R$1,$ PUSH$\_$R$1$ ; Save R$1$

ST R$2,$ PUSH$\_$R$2$ ; Save R$2$

ST R$3,$ PUSH$\_$R$3$ ; Save R$3$

ST R$4,$ PUSH$\_$R$4$ ; Save R$4$

AND R$0,$ R$0,$ #$0$ ; Clear R$0$ to use as counter$/$result

; Check for division by zero or negative inputs

ADD R$3,$ R$2,$ #$0$ ; Prepare to check R$2$

BRz DIV$\_$ERROR ; Division by zero

BRn DIV$\_$ERROR ; Negative divisor

ADD R$3,$ R$1,$ #$0$ ; Prepare to check R$1$

BRn DIV$\_$ERROR ; Negative dividend

; Main division loop

DIV$\_$LOOP

ADD R$3,$ R$1,$ #$0$ ; Check if we can still subtract

NOT R$4,$ R$2$

ADD R$4,$ R$4,$ #$1$

ADD R$3,$ R$3,$ R$4$ ; R$3=$ R$1-$ R$2$

BRn DIV$\_$END ; If R$3$ is negative, we're done

ADD R$1,$ R$1,$ R$4$ ; Subtract R$2$ from R$1$

ADD R$0,$ R$0,$ #$1$ ; Increment the result

BR DIV$\_$LOOP ; Repeat the loop

DIV$\_$ERROR

LD R$0,$ NEG$\_$ONE ; Set R$0$ to $-1$ to indicate error

DIV$\_$END

LD R$1,$ PUSH$\_$R$1$ ; Restore R$1$

LD R$2,$ PUSH$\_$R$2$ ; Restore R$2$

LD R$3,$ PUSH$\_$R$3$ ; Restore R$3$

LD R$4,$ PUSH$\_$R$4$ ; Restore R$4$

LD R$0,$ PUSH$\_$R$0$ ; Restore R$0$

RET ; Return from the subroutine

; Modulo subroutine

MOD

ST R$0,$ PUSH$\_$R$0$ ; Save R$0$

ST R$1,$ PUSH$\_$R$1$ ; Save R$1$

ST R$2,$ PUSH$\_$R$2$ ; Save R$2$

ST R$3,$ PUSH$\_$R$3$ ; Save R$3$

ST R$4,$ PUSH$\_$R$4$ ; Save R$4$

AND R$0,$ R$0,$ #$0$ ; Clear R$0$ to use for the result

; Modulo checks and operations

ADD R$3,$ R$2,$ #$0$ ; Check if divisor $($R$2)$ is zero

BRz MOD$\_$ERROR ; If zero, cannot mod by zero, error

BRn MOD$\_$ERROR ; Negative divisor, error

ADD R$3,$ R$1,$ #$0$ ; Check if dividend $($R$1)$ is negative

BRn MOD$\_$ERROR ; Negative dividend, error

MOD$\_$LOOP

ADD R$3,$ R$1,$ #$0$ ; Prepare for subtraction

NOT R$4,$ R$2$

ADD R$4,$ R$4,$ #$1$ ; Get $-$R$2$ for subtraction

ADD R$3,$ R$3,$ R$4$ ; Try subtracting R$2$ from R$1$

BRn MOD$\_$END ; If R$1-$ R$2<0,$ we have our remainder

ADD R$1,$ R$1,$ R$4$ ; Subtract R$2$ from R$1$ and continue loop

BR MOD$\_$LOOP

MOD$\_$ERROR

LD R$0,$ NEG$\_$ONE ; Error, set R$0$ to $-1$

MOD$\_$END

LD R$1,$ PUSH$\_$R$1$ ; Restore R$1$

LD R$2,$ PUSH$\_$R$2$ ; Restore R$2$

LD R$3,$ PUSH$\_$R$3$ ; Restore R$3$

LD R$4,$ PUSH$\_$R$4$ ; Restore R$4$

LD R$0,$ PUSH$\_$R$0$ ; Restore R$0$

RET ; Return from subroutine