Question 3 0.2 pts ndexed insertion into a java linked list is Not possible. an O(1) time operation. Much faster than indexed deletion. convenient, but should be 86'ed due to efficiency issues. D Question 4 0.6 pts For an array list of size n, a single insertion can take, in the worst case, I Select) On average, insertions take[Select ] When looking at this, we use Select ] D Question 5 0.4 pts Using indices, binary search on a list implemented by an ArrayList takes worse case time that Select ] with the list size. If the list is implemented by a linked list, it can take worst case time that grows [Select 1 with the list size. D Question 6 0.4 pts Deques can be implemented to run efficiently by underlying [Select] They can easily be used to efficiently implement[Select ]