3.2 Which of the following sorting algorithms could be implemented on a doubly-linked list WITHOUT making the asympotitic 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. , and Ill only B. IV and V only C. and Il only D. and Il only E. All except V