/* * File: ReverseQueue.cpp * ---------------------- * This file tests the ReverseQueue function. */

#include #include "queue.h" #include "stack.h" using namespace std;

/* Function prototypes */

void reverseQueue(Queue & queue); void listQueue(Queue & queue);

/* Test program */

int P4ReverseQueue() { Queue line; line.enqueue("Genesis"); line.enqueue("Exodus"); line.enqueue("Leviticus"); line.enqueue("Numbers"); line.enqueue("Deuteronomy"); listQueue(line); reverseQueue(line); listQueue(line); return 0; }

/* * Function: reverseQueue * Usage: reverseQueue(queue); * --------------------------- * Reverses the order of the elements in a queue. This * implementation does so by using a stack to hold the * values as they are being reversed. */

void reverseQueue(Queue & queue) { // TO DO }

/* * Function: listQueue * Usage: listQueue(queue); * ------------------------ * Lists the contents of the queue on the standard output stream. */

void listQueue(Queue & queue) { Queue copy = queue; cout

The code is attached. Please use Stanford library to implement this problem. Make sure the whole program can run correctly without bugs.

And the first one now Will later be last For the times they they are a-changin. -Bob Dylan, The Times They Are a-Changin', 1963 Following the inspiration from Bob Dylans song (which is itself inspired by Matthew 19:30), write a function void reverseQueue(Queue(string) & queue); that reverses the elements in the queue. Remember that you have no access to the internal representation of the queue and must therefore come up with an algorithmpresumably involving other structuresthat accomplishes the task. Requirments & Hints: Please fill in the TODO part of the function reverseQueue() in P4ReverseQueue.cpp. i > /* G..*] 6 7 #include 8 #include "queue.h" 9 #include "stack.h" 10 using namespace std; 11 12 /* Function prototypes */ 13 14 void reverseQueue (Queue & queue); 15 void listQueue (Queue & queue); 16 17 /* Test program */ 18 19 int P4ReverseQueue () { 20 Queue line; 21 line.enqueue ("Genesis"); 22 line.enqueue ("Exodus"); 23 line.enqueue ("Leviticus"); 24 line.enqueue ("Numbers"); 25 line.enqueue ("Deuteronomy"); 26 listQueue (line); 27 reverseQueue (line); 28 listQueue (line); 29 return 0; 30 } 2 2 * Function: reverseQueue * Usage: reverseQueue (queue); 3 * 32 33 34 35 36 37 38 39 40 + Reverses the order of the elements in a queue. This * implementation does so by using a stack to hold the * values as they are being reversed. */ A 41 42 void reverseQueue (Queue & queue) { //To do } 43 * Function: listQueue * Usage: listQueue (queue); * * Lists the contents of the queue on the standard output stream. */ 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 void listQueue (Queue & queue) { Queue copy = queue; cout