When we talked about ArrayList in Java, we analyzed the time complexity of performing $N$ add operations $($that will require resizing$).$

Assume you start with capacity $10$ and when resizing you increment the memory with $5$ spaces, meaning the new$\_$capacity $=$ old$\_$capacity$+5.$

The total time complexity of performing $N$ add operations $($together with the resizing and copying the data to the new location $)$ is

$(lgN)$

$(Nlo{g}_5(N))$

$(N)$

$(N^2)$

$(1)$