Implement the Python Source code for the following Algorithm. PLEASE HELP ME

(Financial: credit card number validation) Credit card numbers follow certain

patterns: It must have between 13 and 16 digits, and the number must start with:

4 for Visa cards

5 for MasterCard credit 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 whether a credit card is scanned correctly by a scanner. Credit card

numbers are generated following this validity check, commonly known as the

Luhn check or the Mod 10 check, which can be described as follows (for illustration, consider the card number 4388576018402626):

1. Double every second digit from right to left. If doubling of a digit results in a

two-digit number, add up 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

2. Now add all single-digit numbers from Step 1.

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

4. Sum the results from Steps 2 and 3.

5. 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 an integer.

Display whether the number is valid or invalid. Design your program to use the

following functions:

# Return true if the card number is valid

def isValid(number):

# Get the result from Step 2

def sumOfDoubleEvenPlace(number):

# Return this number if it is a single digit, otherwise, return

# the sum of the two digits

def getDigit(number):

# Return sum of odd place digits in number

def sumOfOddPlace(number):

37 + 38 = 75

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

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

Programming Exercises 211

# Return true if the digit d is a prefix for number

def prefixMatched(number, d):

# Return the number of digits in d

def getSize(d):

# Return the first k number of digits from number. If the

# number of digits in number is less than k, return number.

def getPrefix(number, k):

def printArray(lst):

for index in range(len(lst)):

print(" ", lst[index],end='')

def printArrayR(lst):

for index in range(len(lst)-1,0,-1):

print(" ", lst[index], end='')

def bubbleSort(lst):

for i in range(len(lst)-1,0,-1):

for j in range(i):

if lst[j] > lst[j+1]:

temp = lst[j]

lst[j] = lst[j+1]

lst[j+1] = temp

array = [12,44,55,32,90,21,78,34,20,54,66,98]

print(" The Unsorted Array Elements are ", end = '')

printArray(array)print(" The Unsorted Array Elements in Reverse Order ",end='')

printArrayR(array

)bubbleSort(array)print(" Usinng the Bubblesort, the sorted array ",end='')

printArray(array)