nano project - Haskell and scheme -- 2

1. Define a recursive function in Scheme that implements quick sort, which can be specified by the following two rules. a. The empty list is already sorted. b. Non-empty lists can be sorted by sorting the tail values ≤ the head, sorting the tail values > the head, and then appending the resulting list on the either side of the head values. 2. Write a Haskell program that reverse the elements of lists. Examples: reverse [1,3,5, [6,7,12],8,9,2] => [2,9,8, [12,7,6],5,3,1]. 3. Write a Haskell or Scheme function that takes three lists and do the following. a) Remove identical entries in each list if any. b) Perform Union on lists that you will get from step a. c) Perform Intersection on lists that you will get from step a.