Read Section 1.2 of Algorithms on Data Abstraction.

Read Section 1.3 of Algorithms on Stacks, Queues and Bags.

Do Quiz 6 on D2L.

Do the homework assigned on D2L (See Submissions).

In this homework, you will implement a resizing array stack and use a stack to solve some problems.

• Create a new package in IntelliJ IDEA, called ds1.student.stack. Download the following files and save them to this new package.

  • Stack.java
  • ResizingArrayStack.java
  • MyStacks.java

• Implement all the methods and tests as indicated with the TODO comments in both ResizingArrayStack.java and MyStacks.java.

  In some cases, you will need to run the performance tests and interpret the results (as we did in the last homework on Order of Growth).

  Do not change Stack.java. Start with ResizingArrayStack.java first, and then do MyStacks.java.

Note: There are two main programs for this homework. They are in ResizingArrayStack.java and MyStacks.java. You should be sure to run both of them!