Imagine we modify ArrayDeque to avoid modular arithmetic. The add(x) and remove(1) operations are implemented as before, but if either operation would result inj a. length, we resize a so that is has length 3n, set jen and copy the list values in to a in,... 20-11. In this modified structure, if we are currently about to resize the backing array a what can you say about the number of add() and remove() operations since the last time the ArrayDeque was resized, in terms of n (the number of elements currently the ArrayDeque)? Select one: O a At least n add() operations or n/2 remove) operations have occurred since then O b. At least 3n/4 add or remove operations have occurred since then O c. At least n add or remove operations have occurred since then O d. At least 2n/3 add or remove operations have occurred since then O e. At least 1/2 add() or remove) operations have occurred since then