Problem
Describe an efficient data structure for implementing the bag ADT, which supports a method add(e), for adding an element e to the bag, and a method remove(), which removes an arbitrary element in the bag. Show that both of these methods can be done in O(1) time.