Answer:
Enqueue
Dequeue
First
IsEmpty
count
Step-by-step explanation:
A Queue is a FIFO datastructure.Here we have front, rear pointers.
Front points to the beginning of the queue and rear points to the end of the list.we can add elements at the front of the list and can delete the elements from the rear
Enqueue-->Adding an element at the front
Dequeue--->Removing an element from the queue at rear
First-->Gives the first elemnt of the queue
IsEmpty-->checks whether the queue is empty or not
Count--->Gives number of elemnts in the queue