1Problem Statement2Ella loves to play the number game. In that game, she is given a number num for which she has to repeatedly find the sum of digits and replace the number with its sum of digits; she has to keep doing this until the number has a single digit.You must print the product of the digit obtained and her original number.Constraints:0<=num<=2^31-1Input FormatEach test case contains a number num.Output FormatPrint the number after following the above process.Sample Testcase #0Testcase Input38Testcase Output76

Single File Programming QuestionProblem StatementOlivia is a curious mind exploring the world of digits. Create a simple program to assist Olivia in understanding the addition of the last two digits of a given number. Prompt Olivia to input an integer n, calculate, and display the sum of the last two digits.Input format :The input consists of an integer n.Output format :The output displays the sum of the last two digits of the input integer.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:10 ≤ n ≤ 105Sample test cases :Input 1 :10Output 1 :1Input 2 :231Output 2 :4Input 3 :7896Output 3 :15Input 4 :100000Output 4 :0Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.

Single File Programming QuestionProblem StatementPaul is working on a program to manipulate 4-digit numbers. Write a program for him toRemove the last digit.Print the resulting number.Add 1 to the resulting number.Print the result.Note: This question helps in implementing logic for company-specific questions.Input format :The input consists of an integer N, representing the 4-digit number.Output format :The output prints the modified numbers, separated by space.Refer to the sample output for formatting specifications.Code constraints :1000 ≤ N ≤ 9999Sample test cases :Input 1 :1000Output 1 :100 101Input 2 :5896Output 2 :589 590Input 3 :9999Output 3 :999 1000

James, a mathematics teacher, is developing a programming exercise to help his students practice continuously summing the digits of a number until it becomes a single-digit integer. He wants to create a simple program using a 'while' loop that takes a positive integer input and generates the final single-digit result. Input format :The input consists of a positive integer n.Output format :The output prints "The single-digit sum of n is Y." where n is the input integer and Y is its single-digit sum.Refer to the sample output for formatting specifications.Code constraints :1 ≤ n ≤ 1010Sample test cases :Input 1 :456Output 1 :The single-digit sum of 456 is 6.Input 2 :999Output 2 :The single-digit sum of 999

write a program to check whether a number is a special 2-digit number or not. A Special 2-digit number is such that when the sum of its digits is added to the products of its digits the result is equal tot he original 2-digit number

Given a number, swap the adjacent bits in the binary representation of the number, and print the new number formed after swapping.Input FormatThe first line of input contains T - the number of test cases. Each of the next T lines contains a number N.Output FormatFor each test case, print the new integer formed after swapping adjacent bits, separated by a new line.Constraints1 <= T <= 1000000 <= N <= 109ExampleInput410743100Output51123152ExplanationTest-Case 1Binary Representation of 10: 000...1010After swapping adjacent bits: 000...0101 (5)Test-Case 2Binary Representation of 7: 000...0111After swapping adjacent bits: 000...1011 (11)