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

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a?
a) Queue
b) Stack
c) Tree
d) Linked list