1. If we were to use the following expansion technique for an
  ArrayList, what would the amortized Big-O of an addToBack()
  operation?

  ,----
  | void expand(){
  |    int[] newArray = new int[theArray.length+100];
  |    for(int i=0;i<theArray.length,i++)
  |       newArray[i] = theArray[i]
  |    theArray=newArray;
  | }
  | void addToBack(T e){
  |    if(size() + 1 > theArray.length)
  |       expand()
  |    theArray[size()] = e;
  | }
  `----

2. What are the 4 ADT methods for a stack?