Hello, I need help solving this Lab simulation, It uses convert to binary statements and I am very new at coding on this subject so I need help solving it.

Create a program that takes as input a positive integer, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is:

As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x / 2 

Note: The above algorithm outputs the 0's and 1's in reverse order.

If the input is 6, the output is 011. (6 in binary is 110; the algorithm outputs the bits in reverse).

#include

using namespace std;

int main() {

/* Enter your code here. */

return 0;

}