Show the steps in the $($shift and subtract$)$ binary division algorithm to compute the quotient

and remainder when two $6-$bit signed $($two$\text{'}$s complement$)$ numbers are divided. Write the

resultant registers in hexadecimal.

div $s$0,$ $s$1$ # $s$0=0$xFFFFFFE$4$ and $s$1=0$x$18$

mflo $s$2$

mfhi $s$3$