Initially the array has a block of memory that can store at most k entries, where k is a positive constant.

when we insert into a full array, we allocate a new memory block whose size is the size of the current memory block plus a fixed constant value c. We then copy all the elements from the current memory block to the newly allocated memory block, deallocate the old memory block and insert the new element into the new block. The new memory block will be used to store the content of the array afterwards, until we attempt to insert into a full array again.

Prove that performing a series of n insertions into an initially empty resizable array takes (n^2) time, no matter what constant value we assign to c.