Write a recursive Racket function "double-filter that takes two unary boolean functions, f and g, and a list xs, as parameters and returns the list of elements from xs that make both fand g evaluate true. For example (double-filter even? positive? "(-101 23 4]) should evaluate to '[24] because 2 and 4 are the only elments in the list that are both even and positive. Note: Because this problem is supposed to be recursive, you should not call any filter functions on your lists. Save v Grading 1 Run Tests 1 Full Screen code.rkt New #lang racket (provide double-filter) ; do not change any code above this line. Write your code below it. ; return xs, keeping only elems making f and g true 6 (define (double-filter f g xs) 5 Test Case 1 NOT RUN Not run Write a recursive Racket function "double-filter that takes two unary boolean functions, f and g, and a list xs, as parameters and returns the list of elements from xs that make both fand g evaluate true. For example (double-filter even? positive? "(-101 23 4]) should evaluate to '[24] because 2 and 4 are the only elments in the list that are both even and positive. Note: Because this problem is supposed to be recursive, you should not call any filter functions on your lists. Save v Grading 1 Run Tests 1 Full Screen code.rkt New #lang racket (provide double-filter) ; do not change any code above this line. Write your code below it. ; return xs, keeping only elems making f and g true 6 (define (double-filter f g xs) 5 Test Case 1 NOT RUN Not run