Order the following facts such that each fact follows directly from the previous fact.

Question $19$ options:

Repeated adds to an ArrayList will sooner or later cause the underlying array to run out of space.

Repeated adds to an ArrayList will sooner or later require a new array to store the added elements.

If we want the amortized $($i$.$e$.$ average$)$ extra cost of resize to be O$(1)$ time, we could ensure that when we do an O$($n$)$ resize, we've done about n operations that didn't require a resize, spreading that O$($n$)$ cost out amongst those O$($n$)$ operations that didn't have the resize.

When you construct a new array to store the new list of n elements, you have to copy all the elements from the current array to the new one, and then reset the current array pointer to point to the new array.

Repeated adds to an ArrayList will sooner or later require an O$($n$)$ resize if the original array had size n$.$

An ArrayList uses an array as backing storage and arrays have fixed size.

When you construct a new array to store the new list of n elements, you have to spend O$($n$)$ time copying from the current array to the new one.