Use racket to write a higher order function to implement the function X. so that X can past the given test. I need valid code plz, random answer will be reported.

Define X to produce the cartesian product of two lists. Write your answer in the Racket file attached. Half of the marks are for using higher-order functions to minimize the use of recursion. You may write helper functions. (check-equal? ( X ' (a b c) '(d e f)) '( (a d) (a e) (a f ) (b d) (b e) (b f ) (c d) (e)(c f )) ) ;igher-order functions ; Implement X to produce the cartesian product of two lists. ; Write your answer here. ; Half of the marks are for using higher-order functions ; to minimize the use of recursion. You may write helper functions. (provide (contract-out (require rackunit) (modulet test (require rackunit)) ; cartesian-products (list? list? . list?)))) (modulet test (check-equal? (X (a b c) (d e f)) (a d) (a e) (a f) (b d) (be) (b f) (c d) (ce) (c f))))