Hi! I'm having problems understanding this Python question:

Consider an implementation of a dynamic array, but instead of copying the elements into an array of double the size (that is, from N to 2N) when its capacity is reached, we copy the elements into an array with N/4 additional cells, going from capacity N to capacity N+[N/4]. Prove that performing a sequence of n append operations still runs in O(n) time in this case.

Can you show me an example?