How does the original version of insert given previously compare with the one described in Question 2 with respect to the number of operations required?
Question 2
Describe an implementation of the method insert for Array List that places the entry in position 1 in the last element of the array, the entry in position 2 in the next to-last element, and so on.