1. ArrayList is more efficient than LinkedList for the following operations: P

A. Insert/delete an element in the beginning of the list.

B. Insert/delete an element at the end of the list.

C. Insert/delete an element in the middle of the list.

D. Retrieve an element given the index.

2. The worst time complexity for merge sort is

A. O(N)

B. O(logn)

C. O(1)

D. O(nn)

E. O(nlogn)