Which of the following sorting algorithms could be implemented on a doubly-linked list WITHOUT making the asymptotic worst-case complexity even worse? You must perform the sorting in-place, you CANNOT just copy to an array and then use the normal algorithm

I. Bubble sort
Il. Selection sort
IlI. Insertion sort
IV. Quicksort
V. Heapsort

A. I, II, and IlIl only
B. IV and V only
C. I and II only
D. Iand Il only
E. All except V