Description: Some positive integers N can be split into smaller pieces, such that the pieces are comprised of consecutive digits of N and such that each piece contains the same number of digits. Given an integer N and given a number of digits d, one can then ask if N can be split into pieces such that each pieces has d digits and such that the resulting sequence of numbers is strictly increasing. Examples: - For N = 154152 and d= 2, the answer is yes, since d= 2 implies the following sequence 15, 41, 52 which is increasing. - For N = 154152 and d=3, the answer is no, since d= 2 implies the following sequence 154, 152 which is not increasing. - For N = 154152 and d=5, the answer is no, since 154152 cannot be split into five-digit pieces. - For N = 137 and d=1, the answer is yes, since since d=1 implies the following sequence 1, 3, 7 which is increasing. - For N = 137 and d= 2, the answer is no, since 137 cannot be split into two-digit pieces. - For N = 113 and d=1, the answer is no, since since d=1 implies the following sequence 1, 1, 3 which is not increasing. - For N = 113 and d=3, the answer is yes, since d= 3 implies the following sequence 113 which is increasing. Design, implement and test a Python program which checks to see if a user-supplied positive integer N and a user- specified split d, are such that N can be split into pieces with d digits such that the resulting sequence is strictly increasing. Here are the steps that your program should have: (Note that since no collection other than strings is allowed you will be working with N and d as strings) 0. The program greets the user. 1. The program asks the user if they want to test if a number admits an increasing-split of give size. 2. The program prompts the user to enter a positive integer. If the user enters an invalid input anything other than a positive integer), the program will repeat the questions starting with step 1. 3. The program prompts the user to enter the number of digits in each piece. The program will verify that the input is valid a positive integer which is a proper divisor of the number of digits in the first input); If the input is invalid, the program will repeat the questions starting with step 1. 4. Once the valid input is obtained, the program splits the number into pieces of specified length and displays/prints those pieces in one line (separated by commas). 5. Finally, the program reports whether or not the obtained sequence of numbers is in strictly increasing order. If there is only one piece, it is defined to be in strictly increasing order.