Design an In-Memory Queue (Tradeoffs: Clearing, Background Cleanup, Stale Data)

Problem: Build an In-Memory Queue (including tradeoff discussion) Create an in-memory queue implementation that provides the following operations: enqueue(x) dequeue() (produce an empty indication or an error when no items are present) size() Once the core operations are complete, address these design considerations: At what point should queued entries be removed or their storage released? Is a background worker appropriate for cleanup, compaction, or expiration? If so, how…