Problem Some credit card companies use Luhn algorithm to detect invalid credit card numbers The key thing in this algorithm is to find a check digit, which should be the rightmost digit in any credit card number In this task, you have to implement a version of Luhn algorithm using the instructions given below Step1: Read in credit card number as a series of digits into an array Ask the user to enter series of one digit positive numbers into a one dimensional array the number -1 is used to indicate the end of series, no need to read in -1 into the array The maximum size of the array is set to 20 Step2: Find sum1 (main should call a function passing array and size) Ignoring the last (right most digit) check digit of the credit card number, and moving left, double the value of every second digit and find the sum of these doubled numbers If the result of the doubling operation is a two digit number, you should the doubled number before finding the sum. You must printout the numbers for sum1, these should be in the order (from left to right) as it appears on credit card add the digits of Step 3: find sum2 (main should call a function passing array and size) Find the sum of all other numbers (last digit is not included in this sum as wel). You must printout the numbers for sum1, these should be in the order (from left to right) as it appears on credit card