linkedQueueType queue; queue.addQueue(10); queue.addQueue(20); cout << queue.front() << endl; queue.deleteQueue(); queue.addQueue(2 * queue.back()); queue.addQueue(queue.front()); queue.addQueue(5); queue.addQueue(queue.back() - 2); linkedQueueType tempQueue; tempQueue = queue; while (!tempQueue.isEmptyQueue())     {           cout << tempQueue.front() << " ";           tempQueue.deleteQueue();      }

b. Write out the order of elements that are contained in a queue after the following operations are performed. myQueue.enqueue(new Integer(16)); myQueue.enqueue(new Integer(12)); Integer num1 = myQueue.dequeue(); myQueue.enqueue(new Integer(6)); myQueue.enqueue(new Integer(8)); myQueue.enqueue(new Integer(30)); myQueue.enqueue(new Integer(24)); myQueue.enqueue(new Integer(18)); myQueue.dequeue(); myQueue.dequeue(); myQueue.dequeue(); myQueue.enqueue(new Integer(38); Show how step by step process of arriving at your answer.

Establish a linked queue, and run operations in the linked queue. General operations include：Create queue, one element enqueue, one element dequeue, check if the queue is full. Implementation of algorithm Header file typedef int DataType;   typedef struct Node {             DataType data;             struct Node *next; }Lnode; //define node type   typedef struct Qu {             Lnode *front;             Lnode *rear;      } Queue;//queue type   Source file #include <stdio.h> #include <stdlib.h> #include <string.h> #include <malloc.h> #include "queue.h"   Queue * Initiate_queue()//Initial queue with head node, return pointer of the queue. {               }   int Queue_empty (Queue *queue)//Check if the queue if empty. If it is empty return 1 else return0. {               }   void En_queue(Queue *queue, DataType node)//Enqueue {                         }   DataType De_queue(Queue *queue)//Dequeue a node, return its value. {             Lnode *de_node;…

class Queue {      private static int front, rear, capacity; private static int queue[];  Queue(int c) {  front = rear = 0;  capacity = c;  queue = new int[capacity]; }  static void queueEnqueue(int data) {   if (capacity == rear) {   System.out.printf("\nQueue is full\n");   return;  }     else {   queue[rear] = data;   rear++;  }  return; }  static void queueDequeue() {    if (front == rear) {   System.out.printf("\nQueue is empty\n");   return;  }   else {   for (int i = 0; i < rear - 1; i++) {    queue[i] = queue[i + 1];   }       if (rear < capacity)    queue[rear] = 0;       rear--;  }  return; }   static void queueDisplay() {  int i;  if (front == rear) {   System.out.printf("\nQueue is Empty\n");   return;  }     for (i = front; i < rear; i++) {   System.out.printf(" %d <-- ", queue[i]);  }  return; }   static void queueFront() {  if (front == rear) {   System.out.printf("\nQueue is Empty\n");   return;  }  System.out.printf("\nFront Element is: %d", queue[front]);…