Select all the options below that are true about ArrayLists (a.k.a. ArrayStacks). a) ArrayLists have O(n) (i.e. bad) insertions at the front. b) ArrayLists have O(n) (i.e. bad) removes at the front. c) Array Lists have O(n) (i.e. bad) setting the front element to a different value. d) ArrayLists have O(1) (i.e. good) insertions in the middle. e) ArrayLists have O(1) (i,e. good) removes from the middle. f) ArrayLists have O(1) (i.e. good) setting an element in the middle to a different value. g) Arraylists have O(n) (i.e. bad) insertions at the back. h) ArrayLists have O(n) (i.e. bad) removals at the back. i) Arraylists have O(n) (i.e. bad) setting an element at the back to a different value. j) Arraylists's backing storage is a single array of a 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 Arraylist 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 Arraylist and copying the original and inserted elements into the copy will require zero shifting