Use Racket

Write a structurally recursive function (reject pred? lst) that takes two arguments, a one-argument predicate pred? and a list lst of values of the type accepted by pred?. reject returns a list containing all the items from lst that fail pred?. For example:

 > (reject negative? '(1 2 -1 -2 3 -3 5 -4 4)) '(1 2 3 5 4)