Using a $4-$bit version of the algorithm to save pages, divide ${13}_{\text{t}\text{e}\text{n}}$ by $4_{\text{v}\text{e}\text{n}}$ or ${00001101}_{\text{t}\text{w}\text{o}}$ by ${0100}_{\text{t}\text{w}\text{o}\text{.}}.$ Use the algorithm outlined in the flowchart in figure $3\mathrm{.}9$ and fill in what numbers, in the table, would populate in the Quotient, Divisor, and Remainder in each step of each iteration.

$\backslash$table$[[$Iteration$,$Step,Quotient,Divisor,Remainder$],[0,$Initial Values,$0000,01000000,00001101],[1,1$: Rem $=$ Rem$-$Olv,,,$],[\backslash$table$[[2$b$.$ Rem $0+$Div, ssia$],[00=0$