Recall that an Arraystack (a.ka, an ArrayList) stores n elements in a backing array a at locations a[01. a[1]..an-11: public class Arraystack extends Abstractietis TI) 5: Also recall that, immediately after the backing array a is resized by resize() it has a. length 2n When adding an element the Arraystack grows the backing array, a if it is fullie ifa.lengthen. If we are currently about to grow the backing array a, what can you say about the number of add() and remove() operations (as a function of the current value of n) since the last time the Arraystack was resized? Select one: O a. At least n/2 remove operations have occurred since then O b. At least 2n/3 remove() operations have occurred since then O c. At least n/2 add operations have occurred since then O d. At least 2n/3 add operations have occurred since then OeWe cannot bound either the number of addonor remove operations