solve using C++ program step by step code and screenshot for the output of the program

Write a program to determine the number of times the digit 1 is represented in a list of binary numbers. All

the values should go from 1 to 2^k (inclusive) for some positive integer k. For example, here's the list for

k = 3:

1

10

11

100

101

110

111

1000

Input from the keyboard a single positive integer k (at most 50). This means the list contains the binary

representations of all numbers between 1 and 2^k (inclusive). Output to the screen the total number of times

the number 1 appears in the binary expansion of all integers between 1 and 2^k (inclusive). Note the answer

may not fit into a 32-bit integer. Error check input. Refer to the sample output below.

Sample Runs (2):

Enter a number (50 or less): 3

13 ones appear

Enter a number (50 or less): 15

245761 ones appear