1.Write a function named split that takes as an argument a two-tuple that consists of a list and a pivot value), and returns a two-tuple that contains two lists. The first list is composed of all the elements in the original list that are strictly less than the pivot value. The second list returned is composed of all the elements that are greater than or equal to the pivot value. The type of this function is fn : int list * int -> int list * int list

2.Write a function named quicksort that takes a list as an argument. This function uses the quicksort algorithm to sort the list, and returns the sorted list. This function is of the following type: fn : int list -> int list.