7. Consider the following proposed sorting algorithm supersort(int n, int start, int end, keytype S) if(n > 1) { if (Sistart] > s[end]) swap SIstart] with S[end]: supersort (n-1, start, end-1, s) supersort(n-1, start+l, end, S)i c) (3 pts) Is supersort guaranteed to correctly sort the list of items? Justify your answer (A formal proof of correctness is not required, but you need to do more than show one or two examples