c++:

Suppose that the first number of a sequence is x, where x is an integer.

Define:

a₀ = x; a_n+1 = a_n / 2 if a_n is even;

a_n+1 = 3 X a_n + 1 if a_n is odd.

Then there exists an integer k such that a_k = 1.

**Instructions**

Write a program that prompts the user to input the value of x.

The program outputs:

The numbers a₀, a₁, a₂, . . . , a_k.

The integer k such that a_k = 1

(For example, if x = 75, then k = 14, and the numbers a₀, a₁, a₂, ..., a₁₄, respectively, are 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1.)

Test your program for the following values of x: 75, 111, 678, 732, 873, 2048, and 65535.

Then, enhance this program from by outputting:

The largest number of the sequence a₀ ,a₁ ,a₂ , ..., a_k.

The position of the largest number

For example, for the input sequence: 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the program output should contain the following:

The largest number of the sequence is 340

The position of the largest number is 4