I think the most likely answer would be B.
If you could give Brainliest, it would help me a lot :) Hope this helped!!
A queue remember the order of its elements, but only adds at the tail and removes from the head.
<h3>What is a stack?</h3>
A stack can be defined as a collection that is designed and developed to remember the order of its elements, while allowing elements to be added and removed only at one end i.e either head or tail.
<h3>What is a
queue?</h3>
A queue can be defined as a collection that is designed and developed to remember the order of its elements, and it only allow elements to be added (inserted) at one end and removed only at the other end.
In this context, we can infer and logically deduce that, a queue remember the order of its elements, but would only add at the tail while removing from the head.
Read more on queue here: brainly.com/question/24275089
#SPJ1
Complete Question:
A remember the order of its elements, but only adds at the tail and removes from the head
<span>Half of all traffic deaths happen within 25 miles of the driver's home. This statement is true.</span>
