The following algorithm

step $1$: $x_0$:$=x$;$j$:$=0$

step $2$: while $x_{j}0,$ do

$a_j$:$=$ remainder $of$ integer divide$\frac{x_j}{2}$

$x_{j+1}$:$=$ quotient $of$ integer divide$\frac{x_j}{2}$

$j$:$=j+1$

end while

can be used to convert a positive decimal integer $x$ to its binary equivalent,

$x=(a_n{a}_{n-1}cdots{a}_1{a}_0{)}_2.$

Implement the algorithm $($write a computer program$)$ and apply it to convert the following integers to their binary equivalents.

$($a$)56$

$($b$)1543$