Make this algorithm in a c++ program:

Start 1. Shift the Remainder register left 1 bit 2. Subtract the Divisor register from the left half of the Remainder register and place the result in the left half of the Remainder register Remainderz 0 Remainder 0 Test Remainder 3a. Shift the Remainder register to the left, setting the new rightmost bit to 1 3b. Restore the original value by adding the DiMisor register to the left half of the Remainder register and place the sum in the left half of the Remainder register Also shift the Remainder register to the left, setting the new rightmost bit to 0 No: 32 repetitions 32nd repetition? Yes: 32 repetitions Done. Shift left half of Remainder right 1 bt Start 1. Shift the Remainder register left 1 bit 2. Subtract the Divisor register from the left half of the Remainder register and place the result in the left half of the Remainder register Remainderz 0 Remainder 0 Test Remainder 3a. Shift the Remainder register to the left, setting the new rightmost bit to 1 3b. Restore the original value by adding the DiMisor register to the left half of the Remainder register and place the sum in the left half of the Remainder register Also shift the Remainder register to the left, setting the new rightmost bit to 0 No: 32 repetitions 32nd repetition? Yes: 32 repetitions Done. Shift left half of Remainder right 1 bt