Write down the flowchart of Restoring Division algorithm. And make division of13/4 using Restoring Division algorithm.

Creating a flowchart or visual content is not possible through this text-based platform. However, I can explain the steps of the Restoring Division Algorithm and how to use it to divide 13 by 4.

Restoring Division Algorithm:

1. Initialize: Set quotient Q = 0 and remainder R = dividend (in this case, 13). The divisor is 4.

2. Compare: Compare divisor and remainder. If R >= divisor, go to step 3. If R < divisor, go to step 4.

3. Subtract and Shift: Subtract divisor from remainder R and shift Q to left, setting the least significant bit to 1.

4. Restore and Shift: If R < divisor after subtraction, restore R by adding back the divisor. Shift Q to left, setting the least significant bit to 0.

5. Repeat: Repeat steps 2-4 until all bits of the dividend have been handled.

Now, let's divide 13 by 4 using the Restoring Division Algorithm:

1. Initialize: Q = 0, R = 13 (1101 in binary), divisor = 4 (100 in binary).

2. Compare: R = 13 is greater than divisor = 4. So, go to step 3.

3. Subtract and Shift: R = 13 - 4 = 9 (1001 in binary), shift Q to left and set least significant bit to 1. So, Q = 1.

4. Repeat: Now, handle the next bit of the dividend. Shift R to left and bring down the next bit of the dividend. R = 9 << 1 = 18 (10010 in binary). Compare R = 18 and divisor = 4. Since R > divisor, subtract and shift Q. R = 18 - 4 = 14 (1110 in binary), Q = 1 << 1 | 1 = 3.

5. Repeat: Continue this process until all bits of the dividend have been handled. In the end, Q = 3 and R = 1. So, 13 divided by 4 is 3 remainder 1.