ML Programming project 10-20$

1. Wrtie a Quicksort program and test with sample input list. (30 points) 2.(10 points) Define a function which computes the product of all integers between m and n (with n >= m) inclusive. Use this function to define the function C n,k (the number of combinations of n elements taken k by k), which is defined by C n,k = n!/(k!*(n -k)!) 3.(10 points) Define a function rem_duplicate: ''a list -> ''a list which takes in input a list and removes all the duplicates, Examples: rem_duplicate [] = [] rem_duplicate [1,2,1] = [1,2] rem_duplicate ["a","a","a"] = ["a"] rem_duplicate [[1],[1,2],[1,2,3],[1,2],[4,5]] = [[1],[1,2],[1,2,3],[4,5]] Must be able to explain how project was done as well as what compiler was used for the project. Asking price is 10-20$