#Problem $4\mathrm{.}1$ Write a program that takes in a positive integer as input, and outputs a string of $1\text{'}$s and $0\text{'}$s representing the integer in reverse binary. For an integer x$,$ the algorithm is:

As long as x is greater than $0$ Output x modulo $2($remainder is either $0$ or $1)$ Assign x with x divided by $2$

Note: The above algorithm outputs the $0\text{'}$s and $1\text{'}$s in reverse order.

Ex: If the input is:

$6$

the output is:

$011$

$6$ in binary is $110$; the algorithm outputs the bits in reverse.