Using Java

Program Specification: A Stack is a simple container that is initially empty and need only support three simple operations: isEmpty-reports true if the stack contains no values, otherwise reports false push value - adds value onto the stack. pop - removes the most currently pushed value on the stack - FILO You are to extend your DynArray class to implement a stack which can hold double values and adheres Mandatorv Instance methods to the following public int size() // returns the number of values which are currently on the stack public boolean isEmpty(O // returns true only if there are no values on the stack public void push(double value) // add the specified value onto the stack public double pop ) // if the stack is not empty, // remove and returns the most currently push'd value on the stack // otherwise, //returns Double.NaN public void stackDump() // print all of the values currenty on the stack, in the order that // they would be pop'd off of the stack A Queue is a simple container that is initially empty and need only support three simple operations isEmpty-reports true if the queue contains no values, otherwise reports false. que value-adds value into the queue deQue-removes the least currently queed value in the queue-FIFO. You are to extend your DynArray class to implement a queue which can hold double values and adheres Mandatory Instance methods: to the following: Program Specification: A Stack is a simple container that is initially empty and need only support three simple operations: isEmpty-reports true if the stack contains no values, otherwise reports false push value - adds value onto the stack. pop - removes the most currently pushed value on the stack - FILO You are to extend your DynArray class to implement a stack which can hold double values and adheres Mandatorv Instance methods to the following public int size() // returns the number of values which are currently on the stack public boolean isEmpty(O // returns true only if there are no values on the stack public void push(double value) // add the specified value onto the stack public double pop ) // if the stack is not empty, // remove and returns the most currently push'd value on the stack // otherwise, //returns Double.NaN public void stackDump() // print all of the values currenty on the stack, in the order that // they would be pop'd off of the stack A Queue is a simple container that is initially empty and need only support three simple operations isEmpty-reports true if the queue contains no values, otherwise reports false. que value-adds value into the queue deQue-removes the least currently queed value in the queue-FIFO. You are to extend your DynArray class to implement a queue which can hold double values and adheres Mandatory Instance methods: to the following