Digital Sum The digital sum of a number n is the sum of its digits. Write a recursive function digitalSum(n:int) -> int that takes a positive integer n and returns its digital sum. For example, digitalSum (2019) should return 12 because 2+0+1+9=12. Your Answer: 1 # Put your answer here 2

Indirect recursion is when function A calls  function B, which in turn calls function A.   is it true or false.

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__ ==…