recursive function called Rev takes a string argument (str) and and integer argument(i – the initial string position). Rev prints the str in reverse. You may not use any built-in reverse function or method. You may use string’s length method

please solve in python and give code. thankzz

‘Write a function nesting(), which takes an arbitrary number of parameters, and returns a list containing the arguments. Write another function unnesting(), which takes a list L as the parameter and retums a 1D list. Notice that, you should be able to use loops to solve thisproblem and should not use recursive functions (which we will not cover in this course). ‘Write assertions to test the two functions.For example nesting(1, nesting(2, 3, nesting(4, 5, [6])), [7, 8], 9)unnesting([1, [2, 3, [4, 5, [6]]], [7. 8], 9])   (1, [2, 3, [4, 5, [6]]], [7, 8], 9][1, 2,3, 4, 5, 6, 7, 8 9]

Write a statement that calls the recursive function backwards_alphabet() with input starting_letter.

Write a recursive function that displays a string reversely on the console using the following header: def reverseDisplay(value):For example, reverseDisplay("abcd") displays dcba. Write a test programthat prompts the user to enter a string and displays its reversal.

Write a recursive function to sort an array of integers into ascending order using the following idea: the function must place the smallest element in the first position, then sort the rest of the array by a recursive call. This is a recursive version of the selection sort. (Note: You will probably want to call an auxiliary function that finds the index of the smallest item in the array. Make sure that the sorting function itself is recursive. Any auxiliary function that you use may be either recursive or iterative.) Embed your sort function in a driver program to test it. Turn in the entire program and the output.

language: Python   Problem:  Write a recursive function reverse(sentence) for reversing a sentence. For example, reverse('Who let the dogs out?') will return '?tuo sgod eht tel ohW'. Also write a test case in the program to prove the function given works.

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

in c++ please paste working code. the program should  Input- Julia Lucas Mia -1 With an expected output of-  Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia

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