2. An interesting problem in number theory is sometimes called the "necklace problem." This problem begins with two single-digit numbers. The next number is obtained by adding the two numbers and saving only the ones digit. This process is repeated until the "necklace" closes by returning to the original two numbers. For example, if the starting two numbers are 1 and 8 twelve steps are required to close the necklace: 1 897639 2134718 Write a program that prompts the user for two single-digit integers and then displays the sequence and the number of steps taken 2. An interesting problem in number theory is sometimes called the "necklace problem." This problem begins with two single-digit numbers. The next number is obtained by adding the two numbers and saving only the ones digit. This process is repeated until the "necklace" closes by returning to the original two numbers. For example, if the starting two numbers are 1 and 8 twelve steps are required to close the necklace: 1 897639 2134718 Write a program that prompts the user for two single-digit integers and then displays the sequence and the number of steps taken