Create a Racket program that defines a set of elementary recursive functions (using BASIC recursive, not tail recursive) which satisfy the following claims:

(member x xs) - If x is a symbol and xs is a list of symbols, then (member x xs) is true if and only if x is an element xs

(count x xs) - if x is a symbol and xs is a list of symbols, then (count x xs) is the number of occurrences of x in xs

(append xs ys) - if xs and ys are both lists, then (append xs ys) is the list that results from appending to xs the elements of ys

(reverse xs) - if xs is a list, then (reverse xs) is the list obtained by reversing the elements of xs