When a pop() operation is called on an empty queue, what is the condition called?

When a pop() operation is called on an empty queue, what is the condition called?a.syntax errorb.garbage valuec.overflowd.underflow

What is the term for inserting into a full queue

void myfun(Queue *Q){Stack S;// Say it creates an empty stack S   while (!isEmpty(Q))  {    push(&S, deQueue(Q));  } while (!isEmpty(&S)) {     enQueue(Q, pop(&S)); }}What does the myfun do in general?

An implementation of a queue Q, using two stacks S1 and S2, is given below:void insert(Q, x) {   push (S1, x);}  void delete(Q){   if(stack-empty(S2)) then      if(stack-empty(S1)) then {          print(“Q is empty”);          return;      }      else while (!(stack-empty(S1))){          x=pop(S1);          push(S2,x);      }   x=pop(S2);}Let n insert and m (<=n) delete operations be performed in an arbitrary order on an empty queue Q. Let x and y be the number of push and pop operations performed respectively in the process. Which one of the following is true for all m and n?n+m <= x < 2n and 2m <= y <= n+mn+m <= x < 2n and 2m<= y <= 2n2m <= x < 2n and 2m <= y <= n+m2m <= x <2n and 2m <= y <= 2n

In queue data structure, deleting an element from the queue is called _______.a)Dequeueb)Enqueuec)PUSHd)POP