Suppose that a list's capacity is always exactly its size. What would be the "closest$-$fit" O$-$notation for the amount of time necessary to perform all n append operations?

Suppose, instead, the list's capacity is doubled whenever full. What would be the "closest$-$fit" O$-$notation for the amount of time necessaty to perform all n append operations?