8) This question explores the non-performing division for unsigned integers. The non-performing division is a restoring division algorithm and stores the partial remainders until the result of the trial subtraction is known Thus the remainder is kept in a temporary storage register (T), and in case the difference of (RJemainder and (D jivisor is negative, (R-D)0, instead of restoring the remainder by a restoring addition, the value is taken from this temporany register where it has been stored. Minor variation of this approach might be implemented by storing the result of (R-D) in T register and not write a new value nto Remainder until the result of the check (R-D)0 is known. This solution saves an addition for each 0 bit of the quotient but requires a supplementary investment in the circuitry for remainder conservation. Complete the below table for non-performing division for unsigned integers. Step Action Quotient Temp Divisor Remainder 0 Initial Vals 000000 000000 000000 001010 000000 000000 101100 1 | Temp = Rem-Div | 000000 | 110110 101100 | 001010 000000 | 000000 101100 Temp