Consider an implementation of a dynamic array, but rather than doubling the capacity when the array is full, we copy the elements into an array with [N/4]. additional cells, going from capacity N+[N/4]. What is the running time of performing a sequence of n append operations in this case? Specify this in comments using Big-Oh notation.

by python program