write the function in the python and show me the code

1. Write a function rem_last(elem, values) that takes as inputs a value elem and a list values and that uses recursion to create and return a version of values in which the last occurrence of elem (if any) has been removed. For example: rem last(3, [2, 3, 1, 3, 4, 3, 5]) >remlast(0, [1, 0, 1, 0, 0]) >remlast(1, [1, 0, 1, 0, 0]) >>> rem-last(2, [1, 0, 1, 0, 0]) # no occurrences >rem last (2, [1) CI 1] Notes: - In the recursive call, you will need to take a different approach to reducing the problem than we have typically taken when recursively processing a list. - To figure out the logic of the function, we strongly encourage you to begin by considering concrete cases. Ask yourself the types of design questions that we have asked in lecture and lab, and use the answers to those questions to determine what the function should do