Write a C++ program to output the binary (base-2) representation of a decimal integer. T...

Write a C++ program to output the binary (base-2) representation of a decimal integer. The algorithm for this conversion is to repeatedly divide the decimal number by 2, until it is 0. Each division produces a remainder of 0 or 1, which becomes a digit in the binary number. For example, if we want the binary representation of decimal 13, we find it through the following series of divisions:

The binary representation of 13 is thus 1101. The only problem with this algorithm is that the first division generates the low-order binary digit, the next division generates the second-order digit, and so on, until the last division produces the high-order digit. Thus, if we output the digits as they will be generated, they will be in reverse order. You should use recursion to reverse the order of output.