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 $\backslash$times $\%2($remainder is either $0$ or $1)$Note: The above algorithm outputs the O$\text{'}$s and $1\text{'}$s in reverse order