A sorting algorithm is described as stable if equal elements are in the same relative order in the sorted sequence as in the original sequence. Which of insertion sort, quicksort and mergesort are stable and which are not? Identify which partition algorithm you are using for quicksort.