When choosing the length of the backing array during a resize, we want it to

A$)$be big enough so we don'tSuppose we have m operations with various runtimes. Which of the following m operations' runtimes would lead to amortized O$(1)$ time $($that is$,$ O$($m$)$ time spent over all m operations$)?$

Remember that if it helps, you can think of "amortized time" as being "average time".

$($You don't really need to know anything about amortization to do this problem. I$\text{'}$m asking: what is the average time spent over the m tasks, when the individual task times are as given? And you can use big$-$Oh to ignore multiplicative constants.$)$

A$)$m operations that each take O$(1)$ time

B$)$ m$-1$ operations that each take O$(1)$ time, $1$ operation that takes O$($m$)$ time

C$)$ root m operations that each take O$($root m$)$ time, the remaining m $-$ room m operations each take O$(1)$ time

D$)$ m$/2$ operations that each take O$(2)$ time, m$/4$ operations that each take o$(3)$ time, m$/8$ operations that each take o$(8)$ time and m$/8$ operations that eacht ake o$(1)$ time