Select all the options below that are true about ArrayDeques. a) ArrayDeques have O(n) (i.e. bad) insertions at the front. b) ArrayDeques have O(n) (i.e. bad) removes from the front. c) ArrayDeques have O(n) (i.e. bad) setting the front element to a different value. d) ArrayDeques have O(1) (i.e. good) at insertions in the middle. e) ArrayDeques have O(1) (i.e. good) removes from the middle. f) ArrayDeques have O (1) (i.e. good) setting an element in the middle to a different value. g) ArrayDeques have O(n) (i.e. bad) insertions at the back. h) ArrayDeques have O(n) (i.e. bad) removals from the back. i) ArrayDeques have O(n) (i.e. bad) setting an element at the back to a different value. j) ArrayDeques' backing storage is a single array of fixed size, so repeated insertions will sooner or later require a resize of that array. k) If you have a bunch of insertions into an ArrayDeque at known indices spread out throughout the length of the List, individual insertions will require a lot of shifting, whereas making a copy of the ArrayDeque and copying the original and inserted elements into the copy will require zero shifting