The worst$-$case time complexity of Insertion Sort occurs when:

a$.$ The array is already sorted

b$.$ The pivot is always chosen as the median element

c$.$ The array contains a large number of duplicate elements

d$.$ The array is randomly shuffled