Write a program in C that take 5 digit number as an input from the user and perform the following tasks: 1. Split a number into digits. 2. Find the sum of the all the digits in the number. 3. Find the product of the all the digits in the number. 4. Find maximum number with in the number along with position. 5. Printing the digits in the reverse order.

please code in python Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. The pseudocode is: # Base case: if b is 1, you can just return a + 1 # General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1.

Practicing Loops. Einstein Private Elementary school has three classes in each of its 9 grades. 27 classes in total.  It has kindergarten (grade 0) though 8th grade.   The school allows parents to pay tuition over the nine-month school year.  Tuition for kindergarten is $90 dollars every month.  Tuition for the other grades is $50 times the grade level every month.  (1st grade is $50 a month, second grade is $100 a month, etc.) Design a programming solution that outputs nine tuition payment bills for each of the 27 classrooms.  Each bill must contain the grade number (0 through 8), the classroom number (1 through 3), the month (1 through 9) and the amount of the tuition due. Your output should look something like: Grade Classroom Month Tuition   0             1               1        90   0             1               2        90   0             1               3        90   0             1               4        90   ...   8             3               7      400   8             3…

Computer scientists and mathematicians often use numbering systems other than base 10. Write a program that allows a user to enter a number and a base and then prints out the digits of the number in the new base. Use a recursive function baseConversion (num, base) to print the digits. Hint: Consider base 10. To get the rightmost digit of a base 10 number, simply look at the remainder after dividing by 10. For example, 153 % 10 is 3. To get the remaining digits, you repeat the process on 15, which is just 153 // 10. This same process works for any base. The only problem is that we get the digits in reverse order (right to left). The base case for the recursion occurs when num is less than base and the output is simply num. In the general case, the function (recursively) prints the digits of num // base and then prints num % base. You should put a space between successive outputs, since bases greater than 10 will print out with multi-character "digits." For example, baseConversion(1234,…