3. my-map Define your own Racket function that duplicates the the functionality of map from the standard library. You may not use the built-in map function as a helper function. Your implementation must be recursive Input: The input to my-map is a function that takes a function and a homogeneous list of elements of the same data type compatible with the function. Note: the function argument can be named or anonymous (lambda). Output: A new list of the original elements with the same procedure applied to each. Example: (my-map sqrt '(9 25 81 49)) (3 59 7) (my-map add1 (6 4 8 3)) (7 594) (my-map (lambda (n) (*n n)) (5 7) (25 49) (my-map even? '(2 5 7 12) 4. combine Define a function takes two lists as arguments and returns a single list of pairs (i.e.two element sublists). The the first pair should be the both first elements from the respective lists. The second pairs should be the second elements from the respective lists, and so on. If one input list is longer than the other, extra elements of the longer list are ignored. Your implementation must be recursive. Input: Two lists of elements of any type, potentially heterogenous. The two lists do not have to be the same length. Output: A new list whose elements are each two-element sublists. The first sublist is composed of the first elements from two input lists respectively, the second sublist is composed of the second elements form the two input lists respectively, etc. If one list is longer than the other extra elements of the longer list are ignored. Example: (combine(1 2 3 4) '(a b c d)) "( (1 a) (2 b) (3 C) (4d)) (combine(1 23)'(495 7) ((1 4) (2 9)(3 5)) > (combine ' (3 5 6) '("one" 6.18 #t "two")) '( (3 "one") (5 6.18) (6 #t)) (combine'(5) '0