Write list functions for items a to j that carry out the following tasks for a list of integers a. Swap the first and last elements in the list. b. Shift all elements by one to the right and move the last element into the first position. For example, 14916 25 would be transformed into 25 149 16 c. Replace all even elements with 0 (zeroes) d. Replace each element except the first and last by the larger of its two neighbors. e. Remove the middle element if the list length is odd, or the middle two elements if the length is even f. Move all even element to the front, otherwise preserving the order of the elements. g. Return the second largest element in the list. h. Return true if the list is currently sorted in increasing order. i. Return true if the list contains two adjacent duplicate elements. j. Return true if the list contains duplicate elements (which need not be adjacent). The main) function to test each of the functions is included here for you. You must use the same function names that is provide for you below. Using other function names will result in a zero for this program. Program to test functions a to i. # Define constant variables. ONE_TEN -[1, 2, 3, 4, 5, 6, 7, 8, 9, 10 def main) print ("The original data for all functions is: ONE TENI) a. Demonstrate swapping the first and last element data list (ONE TEN) swapFirstLast (data) pzint("After swapping first and last: ", data) 4b. Demonstrate shifting to the right. data = list (ONETEN) shiftRight (data) print("After shifting right: ", data) - tc. Demonstrate replacing even elements with zero. data list (ONE TEN) replaceEven (data) print ("After replacing even elements: ",data) id. Demonstrate replacing values with the larger of their neighbors. datalist (ONE TEN) replaceNeighbors (data) print ("After replacing with neighbors: ", data) te. Demonstrate removing the middle element. data-1ist (ONE TEN) removeMiddle (data) pzint ("After removing the middle element (s): ",data)