$3.$ Write a program $($div$.$asm$)$ to perform a positive integer division algorithm. Your program will have two inputs: the dividend and divisor and have two outputs: the quotient and remainder. Assume, you will be given only positive values and the divisor will be always greater than zero. Your inputs and outputs are as follows:Write a program $($div$.$asm$)$ to perform a positive integer division algorithm. Your

program will have two inputs: the dividend and divisor and have two outputs: the

quotient and remainder. Assume, you will be given only positive values and the

divisor will be always greater than zero. Your inputs and outputs are as follows: $(20$

points$)$

Register R$1=$ Divisor

Register R$6=$ Dividend

Register R$2=$ Quotient

Register R$3=$ Remainder.

Example: $R1=30,R6=100.$ Therefore $100/30,$ R$2=3$ and R$3=10.$

You can consider to use the follow program framework:

$.$ORIG $3000$

; below is your code

HALT

DIVISOR $,-*L_{{?}_{?}}$#$30$

DIVIDND $,.$FILL #$100$

END

Answer: