The Stack ADT (Chapter 2)

Implement the ArrayListStack based on the example listed on p.100-101. Include the code on p.88 (StackInterface) as well. Add or modify any code that you may need to. In addition, create a test driver (demo program) which illustrates that your code works correctly with respect to push(), pop(), top() isEmpty(), isFull() methods. Supply at least 3 test cases that illustrate the results when push(), pop(), or top() methods are performed.

Include a (brief) analysis of your algorithm and include the pseudo-code. I need a program in the Java language. Here is a code on-page 88.

//---------------------------------------------------------------------------

// StackInterface.java by Dale/Joyce/Weems Chapter 2

// // Interface for a class that implements a stack of T.

// A stack is a last-in, first-out structure.

// package ch02.stacks;

public interface StackInterface { void push(T element) throws StackOverflowException3 ;

// Throws StackOverflowException if this stack is full,

// otherwise places element at the top of this stack. void pop() throws StackUnderflowException;

// Throws StackUnderflowException if this stack is empty,

// otherwise removes top element from this stack. T top() throws StackUnderflowException;

// Throws StackUnderflowException if this stack is empty,

// otherwise returns top element of this stack. boolean isFull();

// Returns true if this stack is full, otherwise returns false.