Show the computation step for 1101(dividend)/0110(divisor) assuming they are unsigned numbers. Use non-restoring algorithm and the optimized divisor of Lecture note p.17

Optimized Divider Restoring division) (Non-rstring d *IterationDivisor Remainder Remainder 0000 0111 0000 111- 0 0010 0000 0111 0000 111- Divisor + 1110 32 bits 1110 110 32-bit ALU 2 + 1110 1100TIIT 1100 ?1100 100 00011 Shift right Shift left Write Contro test Remainder + 1110 +0010 1001 = 0001 1001 001- 64 bits 4 + 1110 0011- 000I 0011 Remainder Quotient One cycle per partial-remainder subtraction Looks a lot like a multiplier! (subtraction for next quotient bit) (addition for Same hardware can be used for both division: when the current quotient bit is ir+ d)x2d2r+2d-d-2r+next quotient bit) (restoring (shift left) shift left) Chapter 3 Arithmetic for Computers-17