Question

Mergesort works by splitting a list of n numbers in half, sorting each half recursively, and merging
the two halves. Which of the following data structures will allow mergesort to work in O n n ( ) log time?
I. A singly linked list
II. A doubly linked list
III. An array
(A) None (B) III only (C) I and II only (D) II and III only (E) I, II, and III