Question 6 (1 point) Suppose you have a list L and you are going to perform some number of remove(i)/add (i,x) where i is around the middle of the list (i will change between calls, but it will be close to n/2 each time.) Suppose you are given an iterator/pointer that is already at the middle of the list. Which of the following data structures are the best choice if we care most about (asymptotic) time performance? (Select all that are best -- ignore amortization for now.) (Recall that O(1) is better than O(logn) is better than O(n). Depending on i, O(1+min{i,ni}) can be better or worse than O(logn), and can be better than O(n). a) ArrayDeque b) ArrayQueue c) ArrayStack/ArrayList d) DualArrayDeque e) RootishArrayStack f) SLList g) DLList h) SEList i) SkiplistList