A linear list of elements in which deletion can be done from one end and insertion can take place only at other end (rear) is known as–

• A. Queues
• B. Stacks
• C. Trees
• D. Branch