Formula for FIFO Update of Compressive Memory

A compressive memory component is maintained as a fixed-size queue that can hold a maximum of 4 items. The current state of the memory is [Item_1, Item_2, Item_3, Item_4], where Item_1 is the oldest item. If a new compressed item, Item_5, is added to this memory, what will be its resulting state?

Compressive Memory Update Anomaly

A compressive memory component is implemented as a queue with a maximum capacity of 3 items. Initially, it contains [C1, C2, C3], where C1 is the oldest item. Subsequently, two new compressed items, C4 and then C5, are added to the memory one after the other. Arrange the items that are removed from the memory in the correct chronological order of their removal.