Hello C++ Question

Design and implement a complete C++ program that will

read a series of integers (greater than 0) from a file (via Linux redirection) and for each integer display (to the screen)

the integer

the number of steps it takes to reach 1

the largest value in the sequence and its position

NOTES:

Assume that all input values in the data file will be integers greater than 0.

When constructing data files, separate each integer with whitespace. Each line in the data file should be terminated with a linefeed.

If the first number in a sequence is a positive integer, x Let ao x, an is defined as follows if an is even, then an+1 an/2 if an is odd, then an*1 3 *an+ 1 Then there exists an integer k, such that ak 1 For example, if: 75, then k = 14 and the numbers in the sequence are: 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1. The largest number in the sequence is 340 and it is a position 4 in the sequence (assuming 75 is at position 1