The table below represents the different iterations of the 3rd divide algorithm covered in class for a 8 bit division. Fill in the missing binary values. (You do NOT need to fill in the step descriptions.

Remember to not leave any spaces between the binary values.

The table below represents the different iterations of the 3rd divide algorithm covered in class for a 8 bit division. Fill in the missing binary values. (You do NOT need to fill in the step descriptions. Remember to not leave any spaces between the binary values. Iteration Step Initial Value Divisor 00000101 Remiander 0000000000010100 0 00000101 00000101 1 13 00000101 12 00000101 2 13 00000101 2 00000101 3 3 00000101 2 00000101 4 3 00000101 2 00000101 5 3 00000101 12 00000101 6 3 00000101 12 00000101 7 13 00000101 12 00000101 8 3 00000101 00000101 The table below represents the different iterations of the 3rd divide algorithm covered in class for a 8 bit division. Fill in the missing binary values. (You do NOT need to fill in the step descriptions. Remember to not leave any spaces between the binary values. Iteration Step Initial Value Divisor 00000101 Remiander 0000000000010100 0 00000101 00000101 1 13 00000101 12 00000101 2 13 00000101 2 00000101 3 3 00000101 2 00000101 4 3 00000101 2 00000101 5 3 00000101 12 00000101 6 3 00000101 12 00000101 7 13 00000101 12 00000101 8 3 00000101 00000101