(40 points) Credit card numbers follow certain patterns. A credit card number must have between 13 and 16 digits. The number must start with the following:

4 for Visa cards

5 for MasterCard cards

37 for American Express cards

6 for Discover cards

In 1954, Hans Luhn of IBM proposed an algorithm for validating credit card numbers. The algorithm is useful to determine whether a card number is entered correctly or is scanned correctly by a scanner. Almost all credit card numbers are generated following this validity check, commonly known as the Luhn check or the Mod 10 check. It can be described as follows. (For illustration, consider the card number 4388576018402626.)

Double every second digit from right to left. If doubling of a digit results in a two-digit number, add the two digits to get a single digit number.

4388576018402626:

2*2 =4, 2*2=4, 4*2=8, 1*2=2, 6*2=12 (1+2 =3), 5*2=10 (1+0=1)

8*2= 16(1+6=7), 4*2=8

Now add all single -digit numbers from step 1.

4+4+8+2+3+1+7+8=37

Add all digits in the odd places from right to left in the card number.

6+6+0+8+0+7+8+3=38

Sum the results from step 2 and step 3.

37+38=75

If the result from step 4 is divisible by 10, the card number is valid; otherwise, it is invalid. For example, the number 4388576018402626 is invalid, but the number 4388576018410707 is valid.

Write a program that prompts the user to enter a credit card number as a string. Display whether the number is valid. Design your program to use the following functions:

// Return true if the card number is valid

bool isValid (char cardNumber [] )

// Get the result from step 2

int sumOfDoubleEvenPlace (char cardNumber [] )

// Return this number if it is a single digit, otherwise, return the sum of the two //digits

int getDigit (int number)

// Return sum of odd-place digits in the card number

int sumOfOddPlace(char cardNumber [] )

// Return true if substr is the prefix for card number

bool startsWith (char cardNumber [], char substr[])