//Completion 4
stack <int> vs1; //Initialize a stack of integers as vs1
stack <int> vs2; //Initialize a stack of integers as vs2
int TempPtr = 0; //Initialize TempPtr as an integer and set its starting value to zero
for(int CurrentPtr = 1; CurrentPtr < 101; CurrentPtr++) //Do this 100 times
	vs1.push(CurrentPtr); //Push the CurrentPtr into stack vs1
cout << "Stack One: " << vs1.length() << endl; //Output the size of the first stack
cout << "Stack Two: " << vs2.length() << endl; //Output the size of the second stack
vs2 = vs1; //Set the second stack equal to the first stack
do{
	cout << vs1.top() << endl; //Output the top of stack 2
	vs1.pop(); //Take the value out of the current spot in stack 1
}while(!vs1.isEmpty()); //do while the stack still has stuff in it


//Completion 5
randomize(); //Randomize the numbers
int TempInt = 0; //Initialize a integer holder TempInt as zero
queue <int> vq; //Make a queue of integers names vq
for(int CrrntRandom = 0; CrrntRandom < 10; CrrntRandom++)
{
	vq.enqueue(int random(100 - 1) + 1; //Add an item to the queue
}
cout << "Length: " << vq.length() << endl; //Output the length of the queue to the screen
for(int CurrntNumber = 0; CurrntNumber < 10; CurrntNumber++) //Do this 10 times
{	
	TempInt = vq.front(); //Set the temporary integer as the top item
	cout << TempInt << endl; //Output the temporary integer
}