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 grow[Select ] with the list size. grows logarithmically grows quadratically is constant, not growing grows linearly grows, with some other function Question4 0.6 pts For an array list of size n, a single insertion can take, in the worst case, [ Select ] On average, insertions tak IS V [Select ] linear time constant time logarithmic time quadratic time When looking at this, we use [Select ] 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 usSelec sentinel node natural operations stuff amortized analysis Question 5 0.4 pts Using indices,binary search on a list implemented by an ArrayList takes worse case time that [Select ] is constant, not growing grows linearly grows quadratically grows with some other function of grows logarithmically ith the list size. If the list is implemented by a linked list, it can take with the list size ct Question 6 0.4 pts Deques can be implemented to run efficiently by underlying [Select] They can easily be used to efficiently implemerSelect] queues but not stacks. neither stacks nor queues. either stacks or queues. stacks but not queus. D Question 4 0.6 pts For an array list of size n, a single insertion can take, in the worst case, [ Select ] V. 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. DQuestion 6 0.4 pts Deques can be implemented to run efficiently by underlying Select) They can easily be used to efficiently implement [Select ]