Suppose We Create a Deque (Double-Ended Queue) Data Structure

Multiple Choice

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?

A) A cross country race.
B) A toll booth on a highway.
C) A Memorial Day parade.
D) A computer keyboard typing buffer.