[RACKET CODING RECURSIVE]

1. Write a Racket function (member? x L) that tests whether x E L where L is a set (represented as a list). (Hint: X E L if and only if either x is equal to the head of L, or x is in the remainder of L.) Test cases: (member? 1 '(3 2 1)) ---> #t (member? 4 '(3 2 1)) ---> #f (member? 1 '0)---> #f (member? 'susan '(susan john ryan)) ---> #t 1. Write a Racket function (member? x L) that tests whether x E L where L is a set (represented as a list). (Hint: X E L if and only if either x is equal to the head of L, or x is in the remainder of L.) Test cases: (member? 1 '(3 2 1)) ---> #t (member? 4 '(3 2 1)) ---> #f (member? 1 '0)---> #f (member? 'susan '(susan john ryan)) ---> #t