Suppose we create a deque $($double$-$ended queue$)$ data structure. It is basically a queue, with its addLast and removeFirst operations, but we also add the addFirst and removeLast operations. Which of the following is best modeled by the deque data structure?

Question $30$ options:

A cross country race.

A toll booth on a highway.

A Memorial Day parade.

A computer keyboard typing buffer.