consider sequence of append operations on an initially empty list appending the first element to the list is done in ( time since there is space for the first item added to the list because one slot was initially allocated in the list storing value in an already allocated slot takes ( time howeveraccording to the accounting methodwe'll claim that the cost of doing the append operation requires an additional two cyber dollars this is still ( complexity each time we run out of space we'll double the number of slots in the fixed size list allocating fixed size list is ( operation regardless of the list size the extra work comes when copying the elements from the old list to the new list fig append cyber dollars this copy belongs to 'acha