public void add(int i, E e) throws IndexOutOfBoundsException { checkIndex(i, size + 1); if (size == data.length) // not enough capacity resize(2 * data.length); // so double the current capacity for (int k=size-1; k >= i; k--) // start by shifting rightmost data[k+1] = data[k]; data[i] = e; // ready to place the new element size++; } 

List x = new ArrayList<>(2);

x.add(0, 10);

x.add(0, 2);

x.add(0, 4);

What will the box and arrow diagram look like after the above program runs?