Select all the options below that are true about ArrayStacks. $($Ignore amortization.$)$

a$)$

ArrayStacks have

$($i$.$e$.$ bad$)$ insertions at the front.

b$)$

ArrayStacks have

$($i$.$e$.$ bad$)$ removes at the front.

c$)$

ArrayStacks have

$($i$.$e$.$ bad$)$ setting the front element to a different value.

d$)$

ArrayStacks have O$(1)($i$.$e$.$ good$)$ insertions in the middle.

e$)$

ArrayStacks have O$(1)($i$.$e$.$ good$)$ removes from the middle.

f$)$

ArrayStacks have O$(1)($i$.$e$.$ good$)$ setting an element in the middle to a different value.

g$)$

ArrayStacks have

$($i$.$e$.$ bad$)$ insertions at the back.

h$)$

ArrayStacks have

$($i$.$e$.$ bad$)$ removals at the back.

i$)$

ArrayStacks have

$($i$.$e$.$ bad$)$ setting an element at the back to a different value.

j$)$

ArrayStacks'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 block of b contiguous elements to insert into an ArrayStack, b individual insertions will require b separate shifts. This will be

$($i$.$e$.$ slow$)$ since shifting is

in the worst$-$case.