Question 2 (Distinct elements in a list) Suppose xs:L(Z) is a list of in tegers. (a) Specify that xs has no duplicate elements, i.e., all the elements in xs are distinct. (b) Consider extreme cases of the specification and instances needing clarifi cation. (c) Give an algorithm which meets the specification and consider its efficiency. If necessary modify the algorithm until it is efficient enough. (d) Downcode the algorithm to Python and test the result