1. Assume the existence of a class Queue whose implementation is unknown (array versus nodes), with operations enqueue, dequeue and isEmpty(). Write a Queue method void reverseQueue() that reverses the order of the elements contained in the Queue. You can assume the existence of any other ADT data structures and their operations.
2.  Assuming the following queue implemented using an array with wraparound 

   Redraw the queue after each of the following “consecutive” operations. In each case, show the contents of the queue as well as the positions of Front and Back.

   (a)    enqueue (3);

   (b)   dequeue ();

   (d)    enqueue (7);

   (e)    dequeue ();

   (c) enqueue (5);

1. Given the Postfix expression

25 ∗ 923 + /−

• Evaluate it. Show the sequence of push and pops with their arguments and the state of the stack after each operation as well as the final result.
• Write the infix equivalent
• Write the prefix equivalent

1. Assume the existence of a templated class stack whose implementation is unknown (array versus nodes), with operations push, pop and isEmpty. Assume that and S1 is an instance of class stack that contains integer elements. Write a boolean stack method that takes as a parameter another stackS2, and returns true if and only if the elements of S2 are exactly the same as the elements of the stack.

Your stacks must not be destroyed at the end of the process.

2. Given the Postfix expression

25∗923 +/−

(a) Evaluate it. Show the sequence of push and pops with their arguments and the state of the stackafter each operation as well as the final result.(b) Write the infix equivalent(c) Write the prefix equivalent3. Assume the existence of a templated classstackwhose implementation is unknown (array versusnodes), with operationspush,popandisEmpty.

3.Assume that andS1is an instance of classstackthatcontains integer elements. Write a booleanstackmethod that takes as a parameter anotherstackS2,and returns true if and only if the elements ofS2are exactly the same as the elements of thestack.Your stacks must not be destroyed at the end of the process.

Patients Who Need Dental Scans Are Kept In A First In First Out Queue. Assume That You Have Found An Already Developed Queue Container In A Software Library. It Provides standard Queue Operations To Insert And Remove Data (Known As Enque And Deque Respectively). However, You Need Some Specific Operations Such As Search() To Look Up A Particular Patient And showAll() To List All The Patients In The Queue. These Additional Operations Are Not Provided By The Library Unit.  Which Design Pattern Would Enable You To Obtain The Additional Functionality Required By The Queue? Justify Your Answer. Supplement Your Answer With A UML Class Diagram. Coding Is NOT Required.