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

As long as $x$ is greater than $0$

Output $x2($remainder is either $0$ or $1)$

$x=\frac{x}{2}$

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

Ex: If the input is:

$6$

tr

$$

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

$528040\mathrm{.}3489528.q3zqy7$

LAB

ACTIVITY

$4\mathrm{.}14\mathrm{.}1$: LAB: Convert to reverse binary

$\frac{0}{10}$

LabProgram.java

Load default template...

$1,$

$2,$

$3,$

$4,$

$5,$

$6,3$

$7,$