3.2 Which of the following sorting algorithms could be implemented on a doubly-linked listWITHOUT making the asymptotic worst-case complexity even worse? You must perform the sortingin-place,you CANNOT just copy to an array and then use the normal algorithm.I. Bubble sortII. Selection sortIII. Insertion sortIV. QuicksortV. HeapsortA.I, II, and III onlyB.IV and V onlyC.I and III onlyD.I and II onlyE.All except V