Select all the options below that are true about ArrayDeques. This is discussed in Lecture $3$ and will be helpful to keep in mind as you complete the Interface Practice programming components of Lab $1.$

Question $3$ options:

a$)$

ArrayDeques are relatively slow to remove from the back.

b$)$

ArrayDeques are relatively fast to insert in the middle.

c$)$

ArrayDeques are relatively fast to remove from the middle.

d$)$

ArrayDeques are relatively slow to remove from the front.

e$)$

ArrayDeques are relatively slow to insert at the back.

f$)$

ArrayDeques are relatively slow to insert at the front.

g$)$

ArrayDeques' backing storage is of fixed size, so repeated insertions will sooner or later require a resize.

h$)$

ArrayDeques are relatively slow to set the front element to a different value.

i$)$

ArrayDeques are relatively slow to set an element at the back to a different value.

j$)$

If you have a block of b contiguous elements to insert into an ArrayDeque, b individual insertions will require b separate shifts. This will be slow since shifting is relatively slow.

k$)$

ArrayDeques are relatively fast to set an element in the middle to a different value.