An ISBN $($International Standard Book Number$)$ consists of $10$ digits $d_1{d}_2{d}_3{d}_4{d}_5{d}_6{d}_7{d}_8{d}_9{d}_{10}.$ The last

digit is a checksum, which is calculated from the other nine digits using the following formula:

$(d_1**1+d_2**2+d_3**3+d_4**4+d_5**5+d_6**6+d_7**7+d_8**8+d_9**9)11$

If the result of the modulo operation is $10,$ the letter $x$ is used for the last digit.

Develop a program that will generalize the process above. It will prompt the user for a positive range of

integers and generate a random integer in this range. Then it will check whether the last digit of the

generated number is equal to $(d_1**1+d_2**2+$dots$+d_{n-1}**(n-1))(n+1),$ where $n$ is the number of

digits of the integer generated. If it is not, in a loop visit each of the digits $d_2$ to $d_{n-1}$ of the number and

Show all solutions your program finds.

Your program should work with positive integers of any length from $3$ to $9.$

NOTE: Since the function $r$ and generates integers between $0$ and the constant RAND$\_$MAX$\_(32767),$ you

can satisfy the minimum requirements for this problem by limiting the length of the interval the user

specifies to $32767,$ so that your program can still be tested with positive integers of any length from $3$ to

Removing this limitation will be considered extension of the functionality of the program.

Design your solution with functions that perform smaller, easier to understand and debug algorithms. Do

not use character or string representation of numbers and do not convert numbers to strings anywhere in

the program. Do not use arrays, vectors, or other collections.