please explain on how to do this problem

Write set membership test and set union programs in each of the languages Scheme and ML. Each function will only be about two or three lines long. As data structure for sets, we will use unordered lists. E.g., the Scheme list (11 15 3) represents the set 3, 11,15). Each element should appear only once in the set. Write Scheme functions memv? and union of the following types. The boolean function memv? takes an element and a list and returns true if and only if the element is in the list. Use the comparison eqv? for comparing individual elements. The function union takes two lists and returns a list representing the set union of the arguments. L.e., the result list contains all the elements that are in either argument list. Similarly, write two ML functions member and union. For comparing individual elements, you carn use =. You can test these programs, but for submitting the homework, it's good enough to have them on paper. The ML compiler is available as/usr/bin/sml on the classes server Write set membership test and set union programs in each of the languages Scheme and ML. Each function will only be about two or three lines long. As data structure for sets, we will use unordered lists. E.g., the Scheme list (11 15 3) represents the set 3, 11,15). Each element should appear only once in the set. Write Scheme functions memv? and union of the following types. The boolean function memv? takes an element and a list and returns true if and only if the element is in the list. Use the comparison eqv? for comparing individual elements. The function union takes two lists and returns a list representing the set union of the arguments. L.e., the result list contains all the elements that are in either argument list. Similarly, write two ML functions member and union. For comparing individual elements, you carn use =. You can test these programs, but for submitting the homework, it's good enough to have them on paper. The ML compiler is available as/usr/bin/sml on the classes server