Please Do in Racket

Define a function that takes two arguments, a list and a single element. Your function should return true (#t) if the element is a member of the list and false (#f) if it does not. You may not use the built-in member or element functions as helper functions. Your implementation must be recursive Input: A list of elements of any data type, potentially heterogenous and a single atom of any data type. Output: A boolean value that indicates whether the input atom is a member of the input list. Example: (is-member? 6 ' (4 8 6 2 1)) #t (is-member? 7 ' (4 8 6 2 1)) #f