A. We looked at three ideas for implementation FIFO queues, and all of them perform n insert/remove operations in time proportional to n. The first two that we looked at are even stronger; they take at most a constant amount of time per operation.