Write down the step for restoring and non-restoring of division operations.

Restoring division operation :
Step 1 : Shift A and Q left one binary position.
Step 2 : Subtract divisor from A and place answer back in A(A ← A – B).
Step 3 : If the sign bit of A is 1, set Q₀ to 0 and add divisor back to A (that is, restore A); otherwise, set Q₀ to 1.
Step 4 : Repeat steps 1, 2 and 3 up to n times.

Non-restoring division operation :
Step 1 : If the sign of A is 0, shift A and Q left one bit position and subtract divisor from A; otherwise, shift A and Q left and add divisor to A.
Step 2 : If the sign of A is 0, set Q₀ to 1; otherwise, set Q₀ to 0.
Step 3 : Repeat steps 1 and 2 for n times.
Step 4 : If the sign of A is 1, add divisor to A. Step 4 is required to leave the proper positive remainder in A at the end of n cycles.