Using GNU Prolog please.

3 You will reimplement the Quicksort given in textbook and lecture slides. In the given example, the first (left-most) element of the given list is selected as the pivot. In this question, you must choose the second element of the list as the pivot. Hint: You can represent the input list into pairs: [First | [Pivot | Tail]]. You must write comments to indicate the size-n problem, stopping condition and its return value, size m-problems, and construction of the size-n problem from size-m problems. [7 points] Test case: |?- qsort2([ [8,3,4,12,25,4,6,1,9,22,6], Sorted). It returns: Sorted =[1,3,4,4,6,6,8,9,12,22,25]