What is the amortized complexity of inserting n elements into a dynamic array using the following c++ code. Assume the array is empty.

int current_size = 0; int limit = 0; doubel* array = 0;

void Add_Array::(int n) if (current_size == limit) { if (array == 0) { array_limit += 1; array = new double[limit]; } else { double* copy_array = new double[limit * 2]; for (int i = 0; i < limit; i++) { copy_array[i] = array[i]; } delete[] array; array = copy_array; array_limit *= 2; } array[current_size] = n; current_size += 1; }