write a C++ program that finds all the divisors of the integers between 1 and 40.

Notes:

Your output should appear as follows:

Number Divisors

1 1

2 1, 2

3 1, 3

4 1, 2, 4

5 1, 5

6 1, 2, 3, 6

etc.

You will want to use nested loops. The outside one to control the numbers 1 to 40. And the second to control the possible divisors ( 1 to N/2 )

Integer division and Mod(%) may be useful.