Program for COSC 504 - Summer 2018 Write a program that uses the operations defined in the stack class to that do the following to stacks of strings composed of printable characters. output file usage is required. Apply all of the previously described programming requirements to this program. construct operations Input and 1-Create three stacks, Stkone, Stktwo, Stkthree and Stkfour. Fill each stack with 15 elements from an input file. Write a print function that will print the stacks leaving the stacks -Rem ove the second element from Stkone. Print the stack and the element that was removed. The stack is otherwise unchanged. Implement the recursive PrintStackUp procedure that prints the elements from the bottom to the top of a stack. Write a function that will create a new stack called the IntersectionStack. It is the intersection of two stacks. Chose the stacks from the list and name them. Write a function that will create a new stack composed of the successors of each of the elements in Stktwo. The original stack remains unchanged. Write a function that will create the UnionStack. It is the union of two stacks. Chose the stacks from the list and name them. s- 4 -Write a function that will find the number of elements in a stack. 4 Write a function that will determine whether two stacks are equal. Choose and name them. - Write a function that will find the maximum and minimum string in a stack. Do not directly compare characters. -Write a function called delete entry that will delete every occurrence of a given value stored in the variable, chstr. The stack is otherwise unchanged. rv- write a function that will delete the last element from Stkone. ?-write a function that will reverse the elements in a stack. ru Write a function that will print the bottom element of a stack, leaving the stack empty - Write a function that will make a copy of a stack. c6 Write a function to determine whether one stack is a sub-stack of another stack. 1- Write a function that will find the difference between two stacks. Choose them r Write a function that will append two stacks. Choose them and name them. The ?-write a recursive function that will recursively replace all of the vowels in a stack and name them. solution is a single stack called Appendstk. of strings with the character 'v. Note: To prove that a funetion works, you must print the stack(s) prior to the actions of the function and after the action(s) of the function. The function has to demonstrate that it gives a true response in the correct situation and a false response in the wrong situation. New stacks must also be printed as they are created to that they exist. Due date: June 26, 2018 show Program for COSC 504 - Summer 2018 Write a program that uses the operations defined in the stack class to that do the following to stacks of strings composed of printable characters. output file usage is required. Apply all of the previously described programming requirements to this program. construct operations Input and 1-Create three stacks, Stkone, Stktwo, Stkthree and Stkfour. Fill each stack with 15 elements from an input file. Write a print function that will print the stacks leaving the stacks -Rem ove the second element from Stkone. Print the stack and the element that was removed. The stack is otherwise unchanged. Implement the recursive PrintStackUp procedure that prints the elements from the bottom to the top of a stack. Write a function that will create a new stack called the IntersectionStack. It is the intersection of two stacks. Chose the stacks from the list and name them. Write a function that will create a new stack composed of the successors of each of the elements in Stktwo. The original stack remains unchanged. Write a function that will create the UnionStack. It is the union of two stacks. Chose the stacks from the list and name them. s- 4 -Write a function that will find the number of elements in a stack. 4 Write a function that will determine whether two stacks are equal. Choose and name them. - Write a function that will find the maximum and minimum string in a stack. Do not directly compare characters. -Write a function called delete entry that will delete every occurrence of a given value stored in the variable, chstr. The stack is otherwise unchanged. rv- write a function that will delete the last element from Stkone. ?-write a function that will reverse the elements in a stack. ru Write a function that will print the bottom element of a stack, leaving the stack empty - Write a function that will make a copy of a stack. c6 Write a function to determine whether one stack is a sub-stack of another stack. 1- Write a function that will find the difference between two stacks. Choose them r Write a function that will append two stacks. Choose them and name them. The ?-write a recursive function that will recursively replace all of the vowels in a stack and name them. solution is a single stack called Appendstk. of strings with the character 'v. Note: To prove that a funetion works, you must print the stack(s) prior to the actions of the function and after the action(s) of the function. The function has to demonstrate that it gives a true response in the correct situation and a false response in the wrong situation. New stacks must also be printed as they are created to that they exist. Due date: June 26, 2018 show