1. Two stacks of the same type are the same if they have the same number of elements and their elements at the corresponding positions are the same. Overload the relational operator == for the class stackType that returns true if two stacks of the same type are the same, false otherwise. Also, prepare the definition of the function template to overload this operator.

2. Repeat exercise 1 for the class linkedStackType.

3. A. Add the following operation to the class stackType:
void reverseStack(stackType &otherStack);
This operation copies the elements of a stack in the reverse order onto another stack.
Consider the following statements: 
stackType stack1;
stackType stack2;
The statement
stack1.reverseStack(stack2);
copies the elements of stack1 onto stack2 in reverse order. That is, the top element of stack1 is the bottom element of stack2, and so on. The old contents of stack2 are destroyed and stack1 is unchanged.
B. prepare the definition of the function template to implement the operation reverseStack.
4. Repeat exercises 3A and 3B for the class linkedStackType.

8. A. prepare the definitions of the functions setWaitingTime, getArrivalTime, getTransactionTime, and getCustomerNumber of the class customerType defined in the section, "Application of Queues: Simulation."


B. prepare the definitions of the functions getRemainingTransactionTime, setCurrentCustomer, getCurrentCustomerNumber, getCurrentCustomerArrivalTime, getCurrentCustomerWaitingTime, and getCurrentCustomerTransactionTime of class serverType defined in the section, "Application of Queues: Simulation."

C. prepare the definition of the function runSimulation to complete the design of the computer simulation program (see the section, "Application of Queues: Simulation"). Test run your program for a variety of data. Moreover, use a random number generator to decide whether a customer arrived at a given time unit.