IN ML : Write a quick sort function of type int list -> int list. Here is a review for quick sort algorithm. First pick an element and call it pivot. (The head of the list is an easy choice for the pivot.) Partition the rest of the list into two sublists, one with all the elements less than the pivot and another one with all the elements not less than the pivot. Recursively sort the sublists. Combine two sublists and pivot into final sorted list.

val partition = fn : int * int list-> int list * int list val quicksort = fn : int list-> int list val nevQuickSort = fn : int list-> int list val it - unit -val x=[3, 1, 4, 8, 9, 5, 7, 6, 2,0]; val x = [3,1,4,8,9,5,7,6,2,0] : int list - quickSort x; val it = [0,1,2,3,4,5,6,7,8,9] : int list