Insertion Sort is stable because:

ot yet swered

ked out of

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

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

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

Od$.$ It requires extra space for sorting