What will be the final elements on the queue and stack if the following sequence of operations are executed? Queue q = new Queue(); Stack s = new Stack(); q.push("a"); s.push("b"); q.push("c"); s.push("d"); s.push( q.pop() ); q.push( s.peek() ); q.push( s.pop() );

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

Identify and describe each operation(s) in a Stack and a Queue.

Q3(a) Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Implement queue function using these three functions and only one stack.

Implement Stack using Queues

Which of the following is TRUE?AStack is a FIFO structureBBoth stack and queue have two active endsCExamples of add operation are push() and dequeue()D“First come first served” is best referred to queue operation