Write a recursive function named get_palindromes (words) that takes a list of words as a parameter. The function should return a list of all the palindromes in the list. The function returns an empty list if there are no palindromes in the list or if the list is empty. For example, if the list is ["racecar", "hello". "noon", "goodbye"], the function should return ["racecar". "noon"]. A palindrome is a word that is spelled the same forwards and backwards. Note: The get_palindromes() function has to be recursive; you are not allowed to use loops to solve this problem. For example: Test Result words = ["racecar", "hello", "noon", "goodbye", "test", "aibohphobia'] ['racecar', 'noon", "aibohphobia"] print (get_palindromes (words)) print(get_palindromes ([])) print(get_palindromes (['this', 'is', 'test'])) Answer: (penalty regime: 0, 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 %) 1 | Precheck Check [] [] Next page

Python. Please solve quickly!!

Modify the recursive Fibonacci function to employ the memoization technique discussed in this chapter. The function creates a dictionary and then defines a nested recursive helper function named memoizedFib. You will need to create a dictionary to cache the sum of the fib function. The base case of the fib function is the same as before. However, before making any recursive calls, the helper function looks up the value for the function’s current argument in the dictionary (use the method get, with None as the default value). If the value exists, the function returns it and skips any recursive calls. Otherwise, after the helper function adds the results of its two recursive calls, it saves the sum in the dictionary with the current argument of the function as the key. Note: The program should output in the following format: n      fib(n) 2       1 4       3 8       21 16      987 32      2178309 ---------------------------------------------------------------------------------- def…

in phython language Write a function named getOddList(). The function takes one parameter which is a list(e.g. inputlist). The function will find the odd numbers in the list and return it as a new list. Call the function with a sample list given as an argument, then print the oddlist. Sample output for a sample list [-4,6,4,7,13,78,9]: [7,13,9]