A sorting algorithm is stable if elements with equal keys are left in the same order as they occur in the input. For each of the sorting algorithms discussed in class, explain if minor modifications can be made $($e$.$g$.,$ changing $<$ to $)$ that make the sort stable.

$(5$ points$)$ Bubble Sort.

$(5$ points$)$ Insertion Sort.

$(5$ points$)$ Shellsort.

$(5$ points$)$ Heapsort.

$(5$ points$)$ Mergesort.