Insertion Sort is stable because:

a$.$ It has a worst$-$case time complexity of $O(n^2)$

b$.$ It requires extra space for sorting

c$.$ It preserves the relative order of equal elements during sorting

d$.$ It doesn't maintain the relative order of equal elements