Using Standard ML language to solve the problem using RECURSIVE definitions.

10. Write a quicksort function takes as its first argument a two-argument function called a comparator and as its second argument a list. For any pair the comparator returns true or false. The function quicksort returns a list consisting of the members of its second argument, ordered so that the comparator returns true on adjacent members. . quicksort (fn (x,y)-> (x [1, 2, 2, 3] * quicksort (fn ( 10. Write a quicksort function takes as its first argument a two-argument function called a comparator and as its second argument a list. For any pair the comparator returns true or false. The function quicksort returns a list consisting of the members of its second argument, ordered so that the comparator returns true on adjacent members. . quicksort (fn (x,y)-> (x [1, 2, 2, 3] * quicksort (fn (