Write a recursive program that takes a positive integer as an input and returns the sum of the digits of the integer. (Example: If the input is 45678, then output will be 30.)

Write a recursive algorithm with the following prototype: int add (int x, int y); that returns x if y is 0; and adds x to y otherwise. THE FUNCTION MUST BE RECURSIVE. (hint: the base case should involve a test for y being 0; recursive case should reduce y towards 0)

use java

Using C write a program that uses a recursive function to find the  greatest common divisor  of two integers provided by the user. Example behavior: ./gcd Enter x: 24 Enter y: 32 The GCD of 24 and 32 is 8

a. Prompt the user to type a word on console and save the input into variable b. Implement recursive method(s) isPalindrome() to check if the given word is a palindrome and call it from the main(). c. Implement recursive method(s) theLength() to calculate the length of the given word (its number of characters) d. Display your results on console in the following format: "You word palindrome." consists of_ characters, this a e. Explain in comments the algorithms you use (how the recursion works, where is the base case, there is the recursive call(s), how you reduce the problem complexity).

write a recursive function that checks see if the first letter matches the last letter, return the middle letters and check until only 0 or 1 letters are left. It returns True or False.   Here is python code that needs to be fixed         # Returns the first character of the string str def firstCharacter(str):     return str[:1] # Returns the last character of a string str def lastCharacter(str):     return str[-1:] # Returns the string that results from removing the first #  and last characters from str def middleCharacters(str):     return str[1:-1] def isPalindrome(str):     # base case #1     # base case #2     # recursive case     pass def isPalindrome(string):     reversedString = string[::-1]      if reversedString == string:          return True     else:          return False inputString = input()  string = inputString.replace(" ", "") if isPalindrome(string):     print(inputString,"is a palindrome")  else:      print(inputString,"is not a palindrome")       if __name__ ==…

1.)I have to recursive with python language and was asked to do a buy 2 get 1 free where you have some amount of money(x) each item costs a given amount(y), for each 2 item you get 1 free, builda recursive solution to find out how many items you can buy for x amount of money. 2.) Buy M, get N free Then alter your first answer to allow for the user to enter any M and N for how many you need to buy to get free items