In c$++$ plz Problem $2-$ Filename: GrayOrdering

Write a program that generates Gray Code for different bit widths. Rather than simply adding one to the

previous binary number to generate the next binary number, Gray Code orders binary numbers

according to the simple principle that no two adjacent numbers can differ by more than a single bit. For

example, the first eight Gray Codes expressed to $3$ bits:

Input from the keyboard a positive number in the range $0,8$ the width of a binary number to

generate. Assume proper input. Output to the screen, a space$-$separated list of the decimal

representation of the numbers $0$ through $2^{w_i}-1$ in Gray Code ordering as seen in the example below.

Finally, the program should ask if the user wants to run the program again $($Check case$).$ Refer to the

sample output below.

Sample Run:

Enter width: $3$

Gray code width $3$: $01326754$

Run Again $(\frac{Y}{N})$:$y$

Enter width: $4$

Run Again $(\frac{Y}{N})$: N