Consider the following sorting algorithms.
I. Quicksort
II. Heapsort
IiI. Mergesort
Which of them perform in least time in the worst case?

A

I and II only

B

II and III only

C

III only

D

I, II and III