Write a program that takes in a positive integer as input, and outputs a string of 1 's and 0's representing the integer in reverse binary. For an integer x, the algorithm is: Aslongasxisgreaterthan0Outputx%2(remainderiseither0or1)x=x/2 Note: The above algorithm outputs the 0's and 1'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. 458626.3144760.93zqy7 \#include using namespace std; int main() \{ / Type your code here. */ return 0