Complete the following linked list implementation of FIFO QUEUE in C++ to add the following member function: o void peekAll(): display all the elements in the queue. The elements stay in the queue after this operation. class QUEUE { private: struct node { int item; node* next; node(int x) { item = x; next = 0; } }; typedef node *link; link head, tail; public: QUEUE(int) { head = 0; } int empty() const { return head == 0; } void put(int x) { link t = tail; tail = new node(x); if (head == 0) head = tail; else t->next = tail; } int get() { int v = head->item; link t = head->next; delete head; head = t; return v; } void peekAll() { /* implement this part */ } }; 2. Write a C++ program that creates a queue of up to 100 integers, and then it does the following on users input (your program must check for conditions: e.g. no get when the queue is empty): P x: puts x into queue G : outputs the element at the head of the queue, and removes this element from the queue E : outputs empty if queue is empty; otherwise not empty F : displays the entire content of the queue in first-in first-out order; no change in the queue Example Dialogue (input can be read from a specific file, or can be directed to a file): E empty P 1 P 10 E not empty F 1 10 P 19 G 1 G 10 E not empty P 5 P 20 F 19 5 20 G 19 G 5 G 20 E empty G nothing to get; queue is empty F nothing to peek; queue is empty P 2 E not empty F 2