Suppose that, starting from an empty data structure, we perform N push operations in our resizing array implementation of a stack. How many times is the resize() method called?

Suppose that you implement a queue using a null-terminated singly-linked list, maintaining a reference to the item least recently added (the front of the list) but not maintaining a reference to the item most recently added (the end of the list). What are the worst case running times for enqueue and dequeue?

Consider the following code that defines a ResizingArrayStackOfStrings:

public class ResizingArrayStackOfStrings
 {

   private String[] s;
   
   private int N;
   ...
}

If the array is completely full, how many bytes does the stack use to store N strings? Give your answer in Tilde notation. Don't count the memory of the actual strings (impossible, since they are of unknown length).