Write a recursive function that returns True if the numerical array passed as input is palindrome, and False otherwise. An array is palidrome if its elements, when flipped, produce an array that is...

Extracted text: Write a recursive function that returns True if the numerical array passed as input is palindrome, and False otherwise. An array is palidrome if its elements, when flipped, produce an array that is identical to the original one. For example: [1,2,3,2,1] is palindrome [1,2,3,4,3] is not palindrome Fill in the following code skeleton. It is composed of four parts: three base cases and the recursive call. Write code for all the parts. Assume that the input arrays can have any size, and that the elements are always positive integers.


Extracted text: def ispalindrome (arr): # Base case 1: # An empty array is always palindrome -> return True # Base case 2: # An arraY of a single element is always palindrome -> return True # Base case 3: # If the f irst and last elements of arr are not identical, # the array is not palindrome -> return False # If we get here it 's because the first and last # elements are identical, therefore: # Recursive call: # Call ispalindrome () dropping the first and last # elements of arr