Answer :
Option B is correct. A linear data structure called a queue performs insertion and delete operations at two separate endpoints.
Elements are added and removed at two separate places in a queue data structure. At one end, the insertion is done, and at the other, the deletion is done. An input queue in computer science is a group of processes waiting to be loaded into memory so they may run a program. Operating System Scheduling, a method for allocating resources among processes, mostly uses input queues. There is no operation to change the contents of the front entry in the Java Class Library interface for Queue. At either end of the ADT deque, items can be pushed, popped, or retrieved.
Learn more about program here-
https://brainly.com/question/14618533
#SPJ4