Given a positive integer 'x' (with even number of digits in it), write an algorithm and the subsequent code to compute the difference between  the sum of the digits occuring in the alternate positions (starting from the first position) and the sum of the digits occuring in the alternate positions,starting from the last rightmost position of 'x'For example, consider the number  8975.  The sum of the digits that occur in the alternate positions from the first position is 8+7=15.  The sum of the digits that occur in the alternate positions, starting from the rightmost position is 5+9 = 14. Difference between the two sums is 1 (=15-14).  Similarly, for the number 5798, the difference between  two sums, is 1.  Note: Read the input as a number and do entire processing as  a numberC++ compilers can compile C code alsoInput format First line contains the positive integerOutput format :First line should contain the difference between  the sum of the digits occuring in the alternate positions (starting from the first position) and the sum of the digits occuring in the alternate positions (startting from the last rightmost position).

Given a number find the absolute difference between left most and right most digit, and repeat it for second from left and second from right, and do repeat it until middle digit is met. Find the sum of those differences and if only one middle digit is available do add it to sum.Input Format:Accept an integer as an inputOutput Format:Print the calculated sum

Alex is creating a utility to evaluate a user's numerical input. The program calculates the absolute difference between the sum of digits at odd and even positions, where the first digit is considered position 1. Users enter a sequence of digits, and the program outputs the result.ExampleInput:5674Output:2Explanation:The sum of the even-position digits 6 and 4 is 10. In the odd position, the sum of digits 5 and 7 is 12. So, the absolute difference is |10-12| = 2.Input format :The input consists of an integer n.Output format :The output prints the difference between the sum of the odd and even position digits in the given integer.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases will fall under the following constraints:10 ≤ n ≤ 107Sample test cases :Input 1 :5674Output 1 :2Input 2 :1234567Output 2 :4Input 3 :10Output 3 :1Input 4 :10000000Output 4 :1

Write down any whole number that has at least two digits. Workingfrom left to right, write down the absolute (non-negative) difference ofeach pair of adjacent digits to form a new number. Repeat this processuntil a single digit is reached. That digit is called the digit differenceresidue (DDR) of the original starting number.For example, 153 has a DDR of 2 and 5537 has a DDR of 0 as shown:1 5 34 225 5 3 70 2 42 20Notice, as in the second example, we keep any differences that are 0.This way, the number of digits always decreases by 1 at each step. Alsonote that the original number we start with cannot begin with 0.a Find the nine 3-digit numbers that all have a DDR of 8.b How many 3-digit numbers have a DDR of 0?c Show that two consecutive 3-digit numbers cannot both have a DDRof 0.d Find the smallest pair of consecutive numbers that both have a DDRof 0.

Answer the questions independently of each other.Consider a 3-digit number of three distinct digits. The digits of the number are rearranged to form a new 3-digit number such that the position of each of the digits is changed. The sum of these two numbers is a 4-digit number whose first two digits are the same as the first digit of the original number and the last digit is 8. Also the sum of the first and last digits of the original number is 8. Find the original and the rearranged number.

The sum of the digits of a two digit number is 8 and the difference between the number and thatformed by reversing the digits is 18. Find the number.