Replace the text $*$FILLINHERE$*$ with the correct code in Prolog to make each function work.

$/*$swap the first two elements if they are not in order$*/$

swap$([$X$,$ Y$|$T$],[$Y$,$ X $|$ T$])$:$-$

Y $=<$ X$.$

$/*$swap elements in the tail$*/$

swap$([$H$|$T$],[$H$|$T$1])$:$-$

swap$($T$,$ T$1).$

$/*$ Comment describing bubbleSort $*/$

bubbleSort$($L$,$SL$)$:$-$

swap$($L$,$ L$1),\%$ at least one swap is needed

$!,$

bubbleSort$($L$1,$ FILLINHERE$).$

bubbleSort$($L$,$ L$).\%$ here, the list is already sorted

$/*$ Comment describing ordered $*/$

ordered$([]).$

ordered$([\_$X$]).$

ordered$([$H$1,$ H$2|$T$])$:$-$

H$1=<$ H$2,$

ordered$([$H$2|$T$]).$

$/*$Comment describing insert$($E$,$ SL$,$ SLE$)...*/$

$/*$Comment describing the $1$st clause of insert $...*/$

insert$($X$,[],[$X$]).$

insert$($E$,[$H$|$T$],[$E$,$H$|$T$])$:$-$

ordered$($T$),$

FILLINHERE$($E$,$ H$),$

$!.$

$/*$Comment describing the $2$nd clause of insert $...*/$

insert$($E$,[$H$|$T$],[$H$|$T$1])$:$-$

ordered$($T$),$

insert$($E$,$ T$,$ FILLINHERE$).$

$/*$ Comment describing insertionSort $*/$

insertionSort$([],[]).$

insertionSort$([$H$|$T$],$ SORTED$)$ :$-$

insertionSort$($T$,$ T$1),$

insert$($H$,$ T$1,$ FILLINHERE$).$

$/*$ Comment to describe meregeSort... $*/$

mergeSort$([],[]).\%$ The empty list is sorted

mergeSort$([$X$],[$X$])$:$-!.$

mergeSort$($L$,$ SL$)$:$-$

split$\_$in$\_$half$($L$,$ L$1,$ L$2),$

mergeSort$($L$1,$ FILLINHERE$),$

mergeSort$($L$2,$ S$2),$

merge$($S$1,$ FILLINHERE, SL$).$

$/*$ Comment to describe split$\_$in$\_$half...$*/$

intDiv$($N$,$N$1,$ R$)$:$-$ R is div$($N$,$N$1).$

split$\_$in$\_$half$([],\_,\_)$:$-!,$ fail.

split$\_$in$\_$half$([$X$],[],[$X$]).$

split$\_$in$\_$half$($L$,$ L$1,$ L$2)$:$-$

length$($L$,$N$),$

intDiv$($N$,2,$N$1),$

length$($L$1,$ FILLINHERE$),$

append$($L$1,$ L$2,$ L$).$

$/*$ Comment describing merge$($S$1,$ S$2,$ S$)*/$

merge$([],$ L$,$ L$).\%$ comment

merge$($L$,[],$L$).\%$ comment

merge$([$H$1|$T$1],[$H$2|$T$2],[$H$1|$ FILLINHERE$])$:$-$

H$1$ FILLINHERE H$2,$

merge$($T$1,[$H$2|$T$2],$T$).$

merge$([$H$1|$T$1],[$H$2|$T$2],[$H$2|$T$])$:$-$

FILLINHERE $=<$ FILLINHERE

merge$([$H$1|$T$1],$ T$2,$ FILLINHERE$).$

$/*$ Comment describing split for quickSort $*/$

split$(\_,[],[],[]).$

split$($X$,[$H$|$T$],[$H$|$SMALL$],$ BIG$)$:$-$

H $=<$ X$,$

split$($X$,$ T$,$ SMALL, FILLINHERE$).$

split$($X$,[$H$|$T$],$ SMALL, $[$H$|$BIG$])$:$-$

X $=<$ H$,$

split$($X$,$ T$,$ FILLINHERE, BIG$).$

$/*$ Comment describing quickSort $*/$

quickSort$([],[]).$

quickSort$([$H$|$T$],$ LS$)$:$-$

split$($H$,$ T$,$ SMALL, FILLINHERE$),$

quickSort$($SMALL$,$ S$),$

quickSort$($BIG$,$ B$),$

append$($S$,[$H$|$B$],$ FILLINHERE$).$